./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.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/pthread-ext/45_monabsex1_vs.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 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 20:12:28,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 20:12:28,383 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 20:12:28,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 20:12:28,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 20:12:28,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 20:12:28,405 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 20:12:28,406 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 20:12:28,407 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 20:12:28,408 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 20:12:28,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 20:12:28,409 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 20:12:28,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 20:12:28,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 20:12:28,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 20:12:28,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 20:12:28,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 20:12:28,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 20:12:28,414 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 20:12:28,415 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 20:12:28,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 20:12:28,417 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 20:12:28,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 20:12:28,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 20:12:28,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 20:12:28,420 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 20:12:28,420 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 20:12:28,421 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 20:12:28,421 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 20:12:28,421 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 20:12:28,422 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 20:12:28,422 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 20:12:28,423 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 20:12:28,423 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 20:12:28,424 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 20:12:28,424 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 20:12:28,425 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 20:12:28,425 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 20:12:28,425 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 20:12:28,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 20:12:28,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 20:12:28,427 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:12:28,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 20:12:28,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 20:12:28,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 20:12:28,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 20:12:28,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 20:12:28,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 20:12:28,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 20:12:28,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 20:12:28,443 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 20:12:28,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 20:12:28,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 20:12:28,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 20:12:28,444 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 20:12:28,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 20:12:28,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 20:12:28,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 20:12:28,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 20:12:28,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 20:12:28,445 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 20:12:28,445 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 20:12:28,445 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 20:12:28,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 20:12:28,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 20:12:28,446 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 20:12:28,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:12:28,446 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 20:12:28,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 20:12:28,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 20:12:28,447 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 20:12:28,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 20:12:28,447 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 20:12:28,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 20:12:28,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 20:12:28,447 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 -> 43a7b886f1e454dafac7facab2674c64a0fa591a6bf106acb1f8b320d6c92508 [2022-02-20 20:12:28,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 20:12:28,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 20:12:28,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 20:12:28,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 20:12:28,641 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 20:12:28,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2022-02-20 20:12:28,686 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0536d0a/6d444bef3e874262a7bba24d04581fee/FLAGf843639cc [2022-02-20 20:12:29,093 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 20:12:29,096 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/45_monabsex1_vs.i [2022-02-20 20:12:29,120 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0536d0a/6d444bef3e874262a7bba24d04581fee/FLAGf843639cc [2022-02-20 20:12:29,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af0536d0a/6d444bef3e874262a7bba24d04581fee [2022-02-20 20:12:29,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 20:12:29,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 20:12:29,136 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 20:12:29,136 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 20:12:29,138 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 20:12:29,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,142 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a38f74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29, skipping insertion in model container [2022-02-20 20:12:29,142 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 20:12:29,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 20:12:29,339 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:12:29,442 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/pthread-ext/45_monabsex1_vs.i[30633,30646] [2022-02-20 20:12:29,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:12:29,457 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 20:12:29,470 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-02-20 20:12:29,486 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/pthread-ext/45_monabsex1_vs.i[30633,30646] [2022-02-20 20:12:29,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 20:12:29,512 INFO L208 MainTranslator]: Completed translation [2022-02-20 20:12:29,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29 WrapperNode [2022-02-20 20:12:29,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 20:12:29,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 20:12:29,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 20:12:29,514 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 20:12:29,532 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:12:29" (1/1) ... [2022-02-20 20:12:29,540 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:12:29" (1/1) ... [2022-02-20 20:12:29,552 INFO L137 Inliner]: procedures = 171, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2022-02-20 20:12:29,552 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 20:12:29,553 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 20:12:29,553 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 20:12:29,553 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 20:12:29,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,558 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,564 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 20:12:29,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 20:12:29,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 20:12:29,569 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 20:12:29,570 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (1/1) ... [2022-02-20 20:12:29,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 20:12:29,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 20:12:29,605 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:12:29,630 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:12:29,642 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2022-02-20 20:12:29,642 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2022-02-20 20:12:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 20:12:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-02-20 20:12:29,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 20:12:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 20:12:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 20:12:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 20:12:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-02-20 20:12:29,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 20:12:29,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 20:12:29,645 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:12:29,771 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 20:12:29,772 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 20:12:29,863 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 20:12:29,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 20:12:29,875 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 20:12:29,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:12:29 BoogieIcfgContainer [2022-02-20 20:12:29,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 20:12:29,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 20:12:29,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 20:12:29,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 20:12:29,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 08:12:29" (1/3) ... [2022-02-20 20:12:29,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fc5de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:12:29, skipping insertion in model container [2022-02-20 20:12:29,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 08:12:29" (2/3) ... [2022-02-20 20:12:29,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76fc5de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 08:12:29, skipping insertion in model container [2022-02-20 20:12:29,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 08:12:29" (3/3) ... [2022-02-20 20:12:29,889 INFO L111 eAbstractionObserver]: Analyzing ICFG 45_monabsex1_vs.i [2022-02-20 20:12:29,893 WARN L150 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-02-20 20:12:29,893 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 20:12:29,893 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 20:12:29,893 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-02-20 20:12:29,921 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,921 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,922 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,922 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,922 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,922 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,922 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,922 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,923 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,925 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,927 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,927 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,928 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,928 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,928 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,928 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,928 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,928 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,929 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,929 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,929 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,929 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,930 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,930 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,930 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,930 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,930 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,931 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,933 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,934 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,934 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,934 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,934 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,934 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of1ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:29,935 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:29,964 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:29,968 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:12:29,969 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 20:12:29,974 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 44 places, 42 transitions, 89 flow [2022-02-20 20:12:29,992 INFO L129 PetriNetUnfolder]: 2/53 cut-off events. [2022-02-20 20:12:29,993 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:29,994 INFO L84 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 53 events. 2/53 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 55 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 28. Up to 4 conditions per place. [2022-02-20 20:12:29,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 42 transitions, 89 flow [2022-02-20 20:12:29,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 42 transitions, 89 flow [2022-02-20 20:12:30,008 INFO L129 PetriNetUnfolder]: 2/46 cut-off events. [2022-02-20 20:12:30,008 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-02-20 20:12:30,008 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:30,009 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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:12:30,009 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:30,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:30,012 INFO L85 PathProgramCache]: Analyzing trace with hash 527068737, now seen corresponding path program 1 times [2022-02-20 20:12:30,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:30,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230367490] [2022-02-20 20:12:30,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:30,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:30,196 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:30,197 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:30,198 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (2 of 3 remaining) [2022-02-20 20:12:30,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 20:12:30,199 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-02-20 20:12:30,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 20:12:30,203 INFO L732 BasicCegarLoop]: Path program histogram: [1] [2022-02-20 20:12:30,205 WARN L235 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:30,205 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2022-02-20 20:12:30,234 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,234 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,234 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,235 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,235 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,235 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,235 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,235 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,235 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,237 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,241 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,241 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,241 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,241 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,242 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,243 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,245 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,245 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,246 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,246 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,246 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,247 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,247 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,247 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,248 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,251 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,251 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,251 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,252 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,252 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,252 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,252 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,252 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,253 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,253 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,253 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,254 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,256 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,258 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,258 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,258 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,259 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,259 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,259 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,259 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,259 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,260 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,260 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,260 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,260 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,260 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,261 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,261 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,261 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,261 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,261 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,264 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,264 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,265 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,265 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,265 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,265 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,266 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,266 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,266 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,266 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,267 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:30,274 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:30,276 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:12:30,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-02-20 20:12:30,278 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 57 places, 53 transitions, 118 flow [2022-02-20 20:12:30,293 INFO L129 PetriNetUnfolder]: 3/77 cut-off events. [2022-02-20 20:12:30,295 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-02-20 20:12:30,297 INFO L84 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 77 events. 3/77 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 108 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 54. Up to 6 conditions per place. [2022-02-20 20:12:30,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 53 transitions, 118 flow [2022-02-20 20:12:30,298 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 53 transitions, 118 flow [2022-02-20 20:12:30,317 INFO L129 PetriNetUnfolder]: 2/47 cut-off events. [2022-02-20 20:12:30,317 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:12:30,318 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:30,318 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] [2022-02-20 20:12:30,318 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:30,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:30,319 INFO L85 PathProgramCache]: Analyzing trace with hash -297621323, now seen corresponding path program 1 times [2022-02-20 20:12:30,319 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:30,319 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313411956] [2022-02-20 20:12:30,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:30,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:30,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#true} [138] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-02-20 20:12:30,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} [121] 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] {60#true} is VALID [2022-02-20 20:12:30,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} [147] 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[] {60#true} is VALID [2022-02-20 20:12:30,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {60#true} [149] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {60#true} is VALID [2022-02-20 20:12:30,433 INFO L290 TraceCheckUtils]: 4: Hoare triple {60#true} [144] L15-->L15-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[] {60#true} is VALID [2022-02-20 20:12:30,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#true} [132] L15-1-->L15-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[] {60#true} is VALID [2022-02-20 20:12:30,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} [125] L15-2-->L15-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[] {60#true} is VALID [2022-02-20 20:12:30,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#true} [119] L15-3-->L15-4: Formula: (and (= 18 (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[] {60#true} is VALID [2022-02-20 20:12:30,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} [148] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {60#true} is VALID [2022-02-20 20:12:30,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {60#true} [151] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-02-20 20:12:30,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {60#true} [128] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-02-20 20:12:30,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {60#true} [135] 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] {60#true} is VALID [2022-02-20 20:12:30,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {60#true} [127] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {60#true} is VALID [2022-02-20 20:12:30,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {60#true} [131] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {60#true} is VALID [2022-02-20 20:12:30,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {60#true} [134] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {60#true} is VALID [2022-02-20 20:12:30,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {60#true} [117] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {60#true} is VALID [2022-02-20 20:12:30,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {60#true} [139] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {60#true} is VALID [2022-02-20 20:12:30,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {60#true} [143] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {60#true} is VALID [2022-02-20 20:12:30,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {60#true} [154] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {60#true} is VALID [2022-02-20 20:12:30,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {60#true} [150] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {60#true} is VALID [2022-02-20 20:12:30,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {60#true} [122] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {60#true} is VALID [2022-02-20 20:12:30,438 INFO L290 TraceCheckUtils]: 21: Hoare triple {60#true} [179] L718-4-->thr1ENTRY: Formula: (and (= 0 |v_thr1Thread1of2ForFork0_#in~arg.base_4|) (= |v_thr1Thread1of2ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of2ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_8| v_thr1Thread1of2ForFork0_thidvar0_2)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_8|} OutVars{thr1Thread1of2ForFork0_#res.offset=|v_thr1Thread1of2ForFork0_#res.offset_4|, thr1Thread1of2ForFork0_~arg.offset=v_thr1Thread1of2ForFork0_~arg.offset_4, thr1Thread1of2ForFork0_~arg.base=v_thr1Thread1of2ForFork0_~arg.base_4, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_8|, thr1Thread1of2ForFork0_#t~nondet4=|v_thr1Thread1of2ForFork0_#t~nondet4_8|, thr1Thread1of2ForFork0_~l~0=v_thr1Thread1of2ForFork0_~l~0_12, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_4|, thr1Thread1of2ForFork0_thidvar1=v_thr1Thread1of2ForFork0_thidvar1_2, thr1Thread1of2ForFork0_thidvar0=v_thr1Thread1of2ForFork0_thidvar0_2, thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_4|, thr1Thread1of2ForFork0_#res.base=|v_thr1Thread1of2ForFork0_#res.base_4|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_#res.offset, thr1Thread1of2ForFork0_~arg.offset, thr1Thread1of2ForFork0_~arg.base, thr1Thread1of2ForFork0_#t~nondet4, thr1Thread1of2ForFork0_~l~0, thr1Thread1of2ForFork0_#in~arg.base, thr1Thread1of2ForFork0_thidvar1, thr1Thread1of2ForFork0_thidvar0, thr1Thread1of2ForFork0_#in~arg.offset, thr1Thread1of2ForFork0_#res.base] {60#true} is VALID [2022-02-20 20:12:30,439 INFO L290 TraceCheckUtils]: 22: Hoare triple {60#true} [168] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread1of2ForFork0_#in~arg.offset_1| v_thr1Thread1of2ForFork0_~arg.offset_1) (= v_thr1Thread1of2ForFork0_~arg.base_1 |v_thr1Thread1of2ForFork0_#in~arg.base_1|)) InVars {thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_1|, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of2ForFork0_~arg.offset=v_thr1Thread1of2ForFork0_~arg.offset_1, thr1Thread1of2ForFork0_~arg.base=v_thr1Thread1of2ForFork0_~arg.base_1, thr1Thread1of2ForFork0_#in~arg.offset=|v_thr1Thread1of2ForFork0_#in~arg.offset_1|, thr1Thread1of2ForFork0_#in~arg.base=|v_thr1Thread1of2ForFork0_#in~arg.base_1|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_~arg.offset, thr1Thread1of2ForFork0_~arg.base] {60#true} is VALID [2022-02-20 20:12:30,439 INFO L290 TraceCheckUtils]: 23: Hoare triple {60#true} [169] L704-->L704-1: Formula: (and (<= |v_thr1Thread1of2ForFork0_#t~nondet4_1| 2147483647) (<= 0 (+ |v_thr1Thread1of2ForFork0_#t~nondet4_1| 2147483648))) InVars {thr1Thread1of2ForFork0_#t~nondet4=|v_thr1Thread1of2ForFork0_#t~nondet4_1|} OutVars{thr1Thread1of2ForFork0_#t~nondet4=|v_thr1Thread1of2ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {60#true} is VALID [2022-02-20 20:12:30,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {60#true} [170] L704-1-->L704-2: Formula: (= |v_thr1Thread1of2ForFork0_#t~nondet4_3| v_thr1Thread1of2ForFork0_~l~0_1) InVars {thr1Thread1of2ForFork0_#t~nondet4=|v_thr1Thread1of2ForFork0_#t~nondet4_3|} OutVars{thr1Thread1of2ForFork0_#t~nondet4=|v_thr1Thread1of2ForFork0_#t~nondet4_3|, thr1Thread1of2ForFork0_~l~0=v_thr1Thread1of2ForFork0_~l~0_1} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_~l~0] {60#true} is VALID [2022-02-20 20:12:30,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {60#true} [171] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread1of2ForFork0_#t~nondet4=|v_thr1Thread1of2ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_#t~nondet4] {60#true} is VALID [2022-02-20 20:12:30,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {60#true} [172] L705-->L706: Formula: (= 4 v_thr1Thread1of2ForFork0_~l~0_3) InVars {} OutVars{thr1Thread1of2ForFork0_~l~0=v_thr1Thread1of2ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread1of2ForFork0_~l~0] {60#true} is VALID [2022-02-20 20:12:30,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {60#true} [173] L706-->L708: Formula: (= v_thr1Thread1of2ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread1of2ForFork0_~l~0=v_thr1Thread1of2ForFork0_~l~0_5} OutVars{thr1Thread1of2ForFork0_~l~0=v_thr1Thread1of2ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {62#(= ~s~0 thr1Thread1of2ForFork0_~l~0)} is VALID [2022-02-20 20:12:30,442 INFO L290 TraceCheckUtils]: 28: Hoare triple {62#(= ~s~0 thr1Thread1of2ForFork0_~l~0)} [174] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread1of2ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread1of2ForFork0_~l~0=v_thr1Thread1of2ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread1of2ForFork0_~l~0=v_thr1Thread1of2ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {61#false} is VALID [2022-02-20 20:12:30,443 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:12:30,443 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:30,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313411956] [2022-02-20 20:12:30,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313411956] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:30,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:30,444 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:30,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840043291] [2022-02-20 20:12:30,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:30,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-02-20 20:12:30,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:30,456 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:12:30,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:30,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:30,507 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:30,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:30,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:30,525 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 53 [2022-02-20 20:12:30,527 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:12:30,543 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:30,543 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 53 [2022-02-20 20:12:30,544 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:30,597 INFO L129 PetriNetUnfolder]: 19/117 cut-off events. [2022-02-20 20:12:30,597 INFO L130 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-02-20 20:12:30,598 INFO L84 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 117 events. 19/117 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 352 event pairs, 10 based on Foata normal form. 35/137 useless extension candidates. Maximal degree in co-relation 119. Up to 37 conditions per place. [2022-02-20 20:12:30,599 INFO L132 encePairwiseOnDemand]: 47/53 looper letters, 14 selfloop transitions, 3 changer transitions 0/51 dead transitions. [2022-02-20 20:12:30,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 51 transitions, 153 flow [2022-02-20 20:12:30,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:30,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2022-02-20 20:12:30,615 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8742138364779874 [2022-02-20 20:12:30,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 139 transitions. [2022-02-20 20:12:30,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 139 transitions. [2022-02-20 20:12:30,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:30,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 139 transitions. [2022-02-20 20:12:30,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 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:12:30,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:12:30,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 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:12:30,624 INFO L186 Difference]: Start difference. First operand has 57 places, 53 transitions, 118 flow. Second operand 3 states and 139 transitions. [2022-02-20 20:12:30,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 51 transitions, 153 flow [2022-02-20 20:12:30,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 51 transitions, 151 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:30,629 INFO L242 Difference]: Finished difference. Result has 55 places, 48 transitions, 124 flow [2022-02-20 20:12:30,630 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=53, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=55, PETRI_TRANSITIONS=48} [2022-02-20 20:12:30,632 INFO L334 CegarLoopForPetriNet]: 57 programPoint places, -2 predicate places. [2022-02-20 20:12:30,635 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 48 transitions, 124 flow [2022-02-20 20:12:30,713 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1172 states, 1166 states have (on average 2.583190394511149) internal successors, (3012), 1171 states have internal predecessors, (3012), 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:12:30,718 INFO L78 Accepts]: Start accepts. Automaton has has 1172 states, 1166 states have (on average 2.583190394511149) internal successors, (3012), 1171 states have internal predecessors, (3012), 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 29 [2022-02-20 20:12:30,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:30,718 INFO L470 AbstractCegarLoop]: Abstraction has has 55 places, 48 transitions, 124 flow [2022-02-20 20:12:30,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 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:12:30,719 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:30,719 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 20:12:30,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 20:12:30,720 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 20:12:30,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1916139092, now seen corresponding path program 1 times [2022-02-20 20:12:30,720 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:30,720 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19914262] [2022-02-20 20:12:30,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:30,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:30,743 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:30,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:30,769 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:30,770 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:30,775 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 4 remaining) [2022-02-20 20:12:30,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2022-02-20 20:12:30,775 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2022-02-20 20:12:30,776 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2022-02-20 20:12:30,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 20:12:30,776 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 20:12:30,776 WARN L235 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:30,776 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2022-02-20 20:12:30,789 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,790 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,790 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,790 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,790 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,790 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,790 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,790 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,791 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,794 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,796 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,796 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,796 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,797 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,798 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,798 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,798 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,798 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,798 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,798 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,798 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,799 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,799 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,799 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,799 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,799 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,800 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,800 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,800 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,800 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,800 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,800 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,800 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,801 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,801 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,801 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,801 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,803 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,806 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,806 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,806 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,806 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,806 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,807 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,807 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,807 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,807 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,807 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,807 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,808 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,808 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,808 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,808 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,808 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,808 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,808 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,809 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,809 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,809 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,809 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,809 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,810 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,810 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,810 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,810 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,811 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,814 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,814 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,814 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,814 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,815 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,815 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,815 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,815 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,815 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,819 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,819 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,819 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,819 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,820 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,824 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,824 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,824 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,824 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,825 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,825 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,825 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,825 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,825 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,827 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,828 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,830 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,830 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,830 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,831 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,831 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,831 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,831 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,832 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,832 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,832 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,832 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of3ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:30,832 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:30,834 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:30,835 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:12:30,835 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-02-20 20:12:30,836 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 70 places, 64 transitions, 149 flow [2022-02-20 20:12:30,857 INFO L129 PetriNetUnfolder]: 4/101 cut-off events. [2022-02-20 20:12:30,862 INFO L130 PetriNetUnfolder]: For 7/7 co-relation queries the response was YES. [2022-02-20 20:12:30,862 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 101 events. 4/101 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 161 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 81. Up to 8 conditions per place. [2022-02-20 20:12:30,863 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 64 transitions, 149 flow [2022-02-20 20:12:30,864 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 64 transitions, 149 flow [2022-02-20 20:12:30,870 INFO L129 PetriNetUnfolder]: 2/47 cut-off events. [2022-02-20 20:12:30,872 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:12:30,873 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:30,873 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] [2022-02-20 20:12:30,873 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:30,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:30,874 INFO L85 PathProgramCache]: Analyzing trace with hash 833747371, now seen corresponding path program 1 times [2022-02-20 20:12:30,875 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:30,875 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816843244] [2022-02-20 20:12:30,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:30,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:30,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:30,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {73#true} [202] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {73#true} [185] L-1-->L-1-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {73#true} is VALID [2022-02-20 20:12:30,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {73#true} [211] L-1-1-->L-1-2: Formula: (= (select |v_#valid_1| 0) 0) InVars {#valid=|v_#valid_1|} OutVars{#valid=|v_#valid_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {73#true} [213] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {73#true} [208] L15-->L15-1: Formula: (and (= (select |v_#valid_2| 1) 1) (= 2 (select |v_#length_1| 1))) InVars {#length=|v_#length_1|, #valid=|v_#valid_2|} OutVars{#length=|v_#length_1|, #valid=|v_#valid_2|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {73#true} [196] L15-1-->L15-2: Formula: (= 48 (select (select |v_#memory_int_1| 1) 0)) InVars {#memory_int=|v_#memory_int_1|} OutVars{#memory_int=|v_#memory_int_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {73#true} [189] L15-2-->L15-3: Formula: (= (select (select |v_#memory_int_2| 1) 1) 0) InVars {#memory_int=|v_#memory_int_2|} OutVars{#memory_int=|v_#memory_int_2|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {73#true} [183] L15-3-->L15-4: Formula: (and (= 18 (select |v_#length_2| 2)) (= (select |v_#valid_3| 2) 1)) InVars {#length=|v_#length_2|, #valid=|v_#valid_3|} OutVars{#length=|v_#length_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {73#true} [212] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {73#true} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {73#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {73#true} [199] 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] {73#true} is VALID [2022-02-20 20:12:30,927 INFO L290 TraceCheckUtils]: 12: Hoare triple {73#true} [191] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {73#true} [195] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {73#true} [198] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {73#true} [181] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {73#true} [203] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {73#true} [207] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 18: Hoare triple {73#true} [218] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 19: Hoare triple {73#true} [214] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {73#true} is VALID [2022-02-20 20:12:30,928 INFO L290 TraceCheckUtils]: 20: Hoare triple {73#true} [186] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {73#true} is VALID [2022-02-20 20:12:30,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {73#true} [253] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_12| v_thr1Thread1of3ForFork0_thidvar0_2) (= |v_thr1Thread1of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_4|, thr1Thread1of3ForFork0_#res.base=|v_thr1Thread1of3ForFork0_#res.base_4|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_4, thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_12, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_4|, thr1Thread1of3ForFork0_#res.offset=|v_thr1Thread1of3ForFork0_#res.offset_4|, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_4, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_8|, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg.base, thr1Thread1of3ForFork0_#res.base, thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~l~0, thr1Thread1of3ForFork0_#in~arg.offset, thr1Thread1of3ForFork0_#res.offset, thr1Thread1of3ForFork0_~arg.base, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_#t~nondet4, thr1Thread1of3ForFork0_thidvar0] {73#true} is VALID [2022-02-20 20:12:30,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {73#true} [232] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of3ForFork0_~arg.base_1 |v_thr1Thread1of3ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of3ForFork0_#in~arg.offset_1| v_thr1Thread1of3ForFork0_~arg.offset_1)) InVars {thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_1, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_1, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~arg.base] {73#true} is VALID [2022-02-20 20:12:30,929 INFO L290 TraceCheckUtils]: 23: Hoare triple {73#true} [233] L704-->L704-1: Formula: (and (<= 0 (+ |v_thr1Thread1of3ForFork0_#t~nondet4_1| 2147483648)) (<= |v_thr1Thread1of3ForFork0_#t~nondet4_1| 2147483647)) InVars {thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_1|} OutVars{thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {73#true} is VALID [2022-02-20 20:12:30,929 INFO L290 TraceCheckUtils]: 24: Hoare triple {73#true} [234] L704-1-->L704-2: Formula: (= |v_thr1Thread1of3ForFork0_#t~nondet4_3| v_thr1Thread1of3ForFork0_~l~0_1) InVars {thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_3|} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_1, thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~l~0] {73#true} is VALID [2022-02-20 20:12:30,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {73#true} [235] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#t~nondet4] {73#true} is VALID [2022-02-20 20:12:30,929 INFO L290 TraceCheckUtils]: 26: Hoare triple {73#true} [236] L705-->L706: Formula: (= v_thr1Thread1of3ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~l~0] {73#true} is VALID [2022-02-20 20:12:30,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {73#true} [237] L706-->L708: Formula: (= v_thr1Thread1of3ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_5} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {75#(= ~s~0 thr1Thread1of3ForFork0_~l~0)} is VALID [2022-02-20 20:12:30,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {75#(= ~s~0 thr1Thread1of3ForFork0_~l~0)} [238] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread1of3ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {74#false} is VALID [2022-02-20 20:12:30,934 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:12:30,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:30,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816843244] [2022-02-20 20:12:30,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816843244] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:30,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:30,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:30,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473183387] [2022-02-20 20:12:30,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:30,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-02-20 20:12:30,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:30,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:12:30,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:30,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:30,955 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:30,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:30,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:30,957 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 64 [2022-02-20 20:12:30,957 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:12:30,957 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:30,957 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 64 [2022-02-20 20:12:30,958 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:31,087 INFO L129 PetriNetUnfolder]: 203/539 cut-off events. [2022-02-20 20:12:31,087 INFO L130 PetriNetUnfolder]: For 193/193 co-relation queries the response was YES. [2022-02-20 20:12:31,091 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1044 conditions, 539 events. 203/539 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3172 event pairs, 124 based on Foata normal form. 160/601 useless extension candidates. Maximal degree in co-relation 680. Up to 259 conditions per place. [2022-02-20 20:12:31,095 INFO L132 encePairwiseOnDemand]: 57/64 looper letters, 21 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-02-20 20:12:31,095 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 66 transitions, 215 flow [2022-02-20 20:12:31,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 168 transitions. [2022-02-20 20:12:31,108 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-02-20 20:12:31,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 168 transitions. [2022-02-20 20:12:31,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 168 transitions. [2022-02-20 20:12:31,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:31,109 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 168 transitions. [2022-02-20 20:12:31,110 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 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:12:31,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:12:31,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:12:31,111 INFO L186 Difference]: Start difference. First operand has 70 places, 64 transitions, 149 flow. Second operand 3 states and 168 transitions. [2022-02-20 20:12:31,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 66 transitions, 215 flow [2022-02-20 20:12:31,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 207 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:31,114 INFO L242 Difference]: Finished difference. Result has 68 places, 60 transitions, 159 flow [2022-02-20 20:12:31,115 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=68, PETRI_TRANSITIONS=60} [2022-02-20 20:12:31,118 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, -2 predicate places. [2022-02-20 20:12:31,118 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 68 places, 60 transitions, 159 flow [2022-02-20 20:12:31,504 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14117 states, 14105 states have (on average 3.4859978730946475) internal successors, (49170), 14116 states have internal predecessors, (49170), 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:12:31,549 INFO L78 Accepts]: Start accepts. Automaton has has 14117 states, 14105 states have (on average 3.4859978730946475) internal successors, (49170), 14116 states have internal predecessors, (49170), 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 29 [2022-02-20 20:12:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:31,550 INFO L470 AbstractCegarLoop]: Abstraction has has 68 places, 60 transitions, 159 flow [2022-02-20 20:12:31,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 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:12:31,551 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:31,551 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 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:12:31,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 20:12:31,553 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:31,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:31,554 INFO L85 PathProgramCache]: Analyzing trace with hash 681039901, now seen corresponding path program 1 times [2022-02-20 20:12:31,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:31,554 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088614867] [2022-02-20 20:12:31,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:31,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:31,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:31,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {14197#true} [202] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {14197#true} [185] 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] {14197#true} is VALID [2022-02-20 20:12:31,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {14197#true} [211] 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[] {14197#true} is VALID [2022-02-20 20:12:31,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {14197#true} [213] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {14197#true} [208] L15-->L15-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[] {14197#true} is VALID [2022-02-20 20:12:31,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {14197#true} [196] L15-1-->L15-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[] {14197#true} is VALID [2022-02-20 20:12:31,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {14197#true} [189] L15-2-->L15-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[] {14197#true} is VALID [2022-02-20 20:12:31,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {14197#true} [183] L15-3-->L15-4: Formula: (and (= 18 (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[] {14197#true} is VALID [2022-02-20 20:12:31,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {14197#true} [212] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {14197#true} is VALID [2022-02-20 20:12:31,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {14197#true} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {14197#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {14197#true} [199] 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] {14197#true} is VALID [2022-02-20 20:12:31,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {14197#true} [191] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {14197#true} is VALID [2022-02-20 20:12:31,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {14197#true} [195] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {14197#true} [198] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {14197#true} is VALID [2022-02-20 20:12:31,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {14197#true} [181] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {14197#true} is VALID [2022-02-20 20:12:31,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {14197#true} [203] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {14197#true} is VALID [2022-02-20 20:12:31,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {14197#true} [207] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,617 INFO L290 TraceCheckUtils]: 18: Hoare triple {14197#true} [218] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {14197#true} is VALID [2022-02-20 20:12:31,617 INFO L290 TraceCheckUtils]: 19: Hoare triple {14197#true} [214] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {14197#true} is VALID [2022-02-20 20:12:31,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {14197#true} [186] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {14197#true} is VALID [2022-02-20 20:12:31,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {14197#true} [253] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_12| v_thr1Thread1of3ForFork0_thidvar0_2) (= |v_thr1Thread1of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_4|, thr1Thread1of3ForFork0_#res.base=|v_thr1Thread1of3ForFork0_#res.base_4|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_4, thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_12, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_4|, thr1Thread1of3ForFork0_#res.offset=|v_thr1Thread1of3ForFork0_#res.offset_4|, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_4, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_8|, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg.base, thr1Thread1of3ForFork0_#res.base, thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~l~0, thr1Thread1of3ForFork0_#in~arg.offset, thr1Thread1of3ForFork0_#res.offset, thr1Thread1of3ForFork0_~arg.base, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_#t~nondet4, thr1Thread1of3ForFork0_thidvar0] {14197#true} is VALID [2022-02-20 20:12:31,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {14197#true} [219] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {14197#true} is VALID [2022-02-20 20:12:31,618 INFO L290 TraceCheckUtils]: 23: Hoare triple {14197#true} [210] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {14197#true} is VALID [2022-02-20 20:12:31,618 INFO L290 TraceCheckUtils]: 24: Hoare triple {14197#true} [207] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,619 INFO L290 TraceCheckUtils]: 25: Hoare triple {14197#true} [218] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {14197#true} is VALID [2022-02-20 20:12:31,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {14197#true} [214] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {14197#true} is VALID [2022-02-20 20:12:31,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {14197#true} [186] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {14197#true} is VALID [2022-02-20 20:12:31,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {14197#true} [254] L718-4-->thr1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_14| v_thr1Thread2of3ForFork0_thidvar0_2) (= |v_thr1Thread2of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread2of3ForFork0_thidvar1_2 0) (= |v_thr1Thread2of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_14|} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_12, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_14|, thr1Thread2of3ForFork0_#res.base=|v_thr1Thread2of3ForFork0_#res.base_4|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_4|, thr1Thread2of3ForFork0_thidvar1=v_thr1Thread2of3ForFork0_thidvar1_2, thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_4, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_4, thr1Thread2of3ForFork0_#res.offset=|v_thr1Thread2of3ForFork0_#res.offset_4|, thr1Thread2of3ForFork0_thidvar0=v_thr1Thread2of3ForFork0_thidvar0_2, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_4|, thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_8|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0, thr1Thread2of3ForFork0_#res.base, thr1Thread2of3ForFork0_#in~arg.offset, thr1Thread2of3ForFork0_thidvar1, thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset, thr1Thread2of3ForFork0_#res.offset, thr1Thread2of3ForFork0_thidvar0, thr1Thread2of3ForFork0_#in~arg.base, thr1Thread2of3ForFork0_#t~nondet4] {14197#true} is VALID [2022-02-20 20:12:31,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {14197#true} [242] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of3ForFork0_#in~arg.offset_1| v_thr1Thread2of3ForFork0_~arg.offset_1) (= v_thr1Thread2of3ForFork0_~arg.base_1 |v_thr1Thread2of3ForFork0_#in~arg.base_1|)) InVars {thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_1, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_1, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset] {14197#true} is VALID [2022-02-20 20:12:31,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {14197#true} [243] L704-->L704-1: Formula: (and (<= |v_thr1Thread2of3ForFork0_#t~nondet4_1| 2147483647) (<= 0 (+ |v_thr1Thread2of3ForFork0_#t~nondet4_1| 2147483648))) InVars {thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_1|} OutVars{thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {14197#true} is VALID [2022-02-20 20:12:31,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {14197#true} [244] L704-1-->L704-2: Formula: (= v_thr1Thread2of3ForFork0_~l~0_1 |v_thr1Thread2of3ForFork0_#t~nondet4_3|) InVars {thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_3|} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_1, thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0] {14197#true} is VALID [2022-02-20 20:12:31,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {14197#true} [245] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_#t~nondet4] {14197#true} is VALID [2022-02-20 20:12:31,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {14197#true} [246] L705-->L706: Formula: (= v_thr1Thread2of3ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0] {14197#true} is VALID [2022-02-20 20:12:31,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {14197#true} [247] L706-->L708: Formula: (= v_thr1Thread2of3ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_5} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {14199#(= (+ thr1Thread2of3ForFork0_~l~0 (* (- 1) ~s~0)) 0)} is VALID [2022-02-20 20:12:31,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {14199#(= (+ thr1Thread2of3ForFork0_~l~0 (* (- 1) ~s~0)) 0)} [248] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread2of3ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {14198#false} is VALID [2022-02-20 20:12:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:12:31,623 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:31,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088614867] [2022-02-20 20:12:31,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088614867] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:31,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:31,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:31,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240239068] [2022-02-20 20:12:31,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:31,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 36 [2022-02-20 20:12:31,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:31,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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:12:31,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:31,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:31,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:31,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:31,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:31,648 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 64 [2022-02-20 20:12:31,648 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 60 transitions, 159 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:12:31,648 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:31,649 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 64 [2022-02-20 20:12:31,649 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:31,810 INFO L129 PetriNetUnfolder]: 222/629 cut-off events. [2022-02-20 20:12:31,811 INFO L130 PetriNetUnfolder]: For 339/339 co-relation queries the response was YES. [2022-02-20 20:12:31,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1411 conditions, 629 events. 222/629 cut-off events. For 339/339 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3941 event pairs, 113 based on Foata normal form. 0/556 useless extension candidates. Maximal degree in co-relation 1347. Up to 292 conditions per place. [2022-02-20 20:12:31,815 INFO L132 encePairwiseOnDemand]: 59/64 looper letters, 23 selfloop transitions, 6 changer transitions 0/70 dead transitions. [2022-02-20 20:12:31,815 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 70 transitions, 260 flow [2022-02-20 20:12:31,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-02-20 20:12:31,817 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8489583333333334 [2022-02-20 20:12:31,817 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 163 transitions. [2022-02-20 20:12:31,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 163 transitions. [2022-02-20 20:12:31,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:31,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 163 transitions. [2022-02-20 20:12:31,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 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:12:31,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:12:31,819 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 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:12:31,819 INFO L186 Difference]: Start difference. First operand has 68 places, 60 transitions, 159 flow. Second operand 3 states and 163 transitions. [2022-02-20 20:12:31,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 70 transitions, 260 flow [2022-02-20 20:12:31,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:12:31,896 INFO L242 Difference]: Finished difference. Result has 70 places, 64 transitions, 199 flow [2022-02-20 20:12:31,897 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=70, PETRI_TRANSITIONS=64} [2022-02-20 20:12:31,897 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 0 predicate places. [2022-02-20 20:12:31,897 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 70 places, 64 transitions, 199 flow [2022-02-20 20:12:32,244 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 16697 states, 16679 states have (on average 3.4394148330235628) internal successors, (57366), 16696 states have internal predecessors, (57366), 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:12:32,276 INFO L78 Accepts]: Start accepts. Automaton has has 16697 states, 16679 states have (on average 3.4394148330235628) internal successors, (57366), 16696 states have internal predecessors, (57366), 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 36 [2022-02-20 20:12:32,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:32,277 INFO L470 AbstractCegarLoop]: Abstraction has has 70 places, 64 transitions, 199 flow [2022-02-20 20:12:32,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 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:12:32,277 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:32,277 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:32,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 20:12:32,277 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:32,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:32,278 INFO L85 PathProgramCache]: Analyzing trace with hash -932714154, now seen corresponding path program 1 times [2022-02-20 20:12:32,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:32,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217420564] [2022-02-20 20:12:32,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:32,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:32,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:32,317 INFO L290 TraceCheckUtils]: 0: Hoare triple {30901#true} [202] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,318 INFO L290 TraceCheckUtils]: 1: Hoare triple {30901#true} [185] 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] {30901#true} is VALID [2022-02-20 20:12:32,318 INFO L290 TraceCheckUtils]: 2: Hoare triple {30901#true} [211] 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[] {30901#true} is VALID [2022-02-20 20:12:32,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {30901#true} [213] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,318 INFO L290 TraceCheckUtils]: 4: Hoare triple {30901#true} [208] L15-->L15-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[] {30901#true} is VALID [2022-02-20 20:12:32,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {30901#true} [196] L15-1-->L15-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[] {30901#true} is VALID [2022-02-20 20:12:32,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {30901#true} [189] L15-2-->L15-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[] {30901#true} is VALID [2022-02-20 20:12:32,319 INFO L290 TraceCheckUtils]: 7: Hoare triple {30901#true} [183] L15-3-->L15-4: Formula: (and (= 18 (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[] {30901#true} is VALID [2022-02-20 20:12:32,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {30901#true} [212] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {30901#true} is VALID [2022-02-20 20:12:32,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {30901#true} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {30901#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {30901#true} [199] 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] {30901#true} is VALID [2022-02-20 20:12:32,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {30901#true} [191] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {30901#true} is VALID [2022-02-20 20:12:32,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {30901#true} [195] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {30901#true} [198] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {30901#true} is VALID [2022-02-20 20:12:32,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {30901#true} [181] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {30901#true} is VALID [2022-02-20 20:12:32,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {30901#true} [203] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {30901#true} is VALID [2022-02-20 20:12:32,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {30901#true} [207] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {30901#true} [218] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {30901#true} is VALID [2022-02-20 20:12:32,321 INFO L290 TraceCheckUtils]: 19: Hoare triple {30901#true} [214] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {30901#true} is VALID [2022-02-20 20:12:32,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {30901#true} [186] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {30901#true} is VALID [2022-02-20 20:12:32,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {30901#true} [253] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_12| v_thr1Thread1of3ForFork0_thidvar0_2) (= |v_thr1Thread1of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_4|, thr1Thread1of3ForFork0_#res.base=|v_thr1Thread1of3ForFork0_#res.base_4|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_4, thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_12, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_4|, thr1Thread1of3ForFork0_#res.offset=|v_thr1Thread1of3ForFork0_#res.offset_4|, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_4, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_8|, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg.base, thr1Thread1of3ForFork0_#res.base, thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~l~0, thr1Thread1of3ForFork0_#in~arg.offset, thr1Thread1of3ForFork0_#res.offset, thr1Thread1of3ForFork0_~arg.base, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_#t~nondet4, thr1Thread1of3ForFork0_thidvar0] {30901#true} is VALID [2022-02-20 20:12:32,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {30901#true} [219] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {30901#true} is VALID [2022-02-20 20:12:32,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {30901#true} [210] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {30901#true} is VALID [2022-02-20 20:12:32,322 INFO L290 TraceCheckUtils]: 24: Hoare triple {30901#true} [207] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,322 INFO L290 TraceCheckUtils]: 25: Hoare triple {30901#true} [218] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {30901#true} is VALID [2022-02-20 20:12:32,323 INFO L290 TraceCheckUtils]: 26: Hoare triple {30901#true} [214] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {30901#true} is VALID [2022-02-20 20:12:32,323 INFO L290 TraceCheckUtils]: 27: Hoare triple {30901#true} [186] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {30901#true} is VALID [2022-02-20 20:12:32,323 INFO L290 TraceCheckUtils]: 28: Hoare triple {30901#true} [254] L718-4-->thr1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_14| v_thr1Thread2of3ForFork0_thidvar0_2) (= |v_thr1Thread2of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread2of3ForFork0_thidvar1_2 0) (= |v_thr1Thread2of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_14|} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_12, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_14|, thr1Thread2of3ForFork0_#res.base=|v_thr1Thread2of3ForFork0_#res.base_4|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_4|, thr1Thread2of3ForFork0_thidvar1=v_thr1Thread2of3ForFork0_thidvar1_2, thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_4, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_4, thr1Thread2of3ForFork0_#res.offset=|v_thr1Thread2of3ForFork0_#res.offset_4|, thr1Thread2of3ForFork0_thidvar0=v_thr1Thread2of3ForFork0_thidvar0_2, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_4|, thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_8|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0, thr1Thread2of3ForFork0_#res.base, thr1Thread2of3ForFork0_#in~arg.offset, thr1Thread2of3ForFork0_thidvar1, thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset, thr1Thread2of3ForFork0_#res.offset, thr1Thread2of3ForFork0_thidvar0, thr1Thread2of3ForFork0_#in~arg.base, thr1Thread2of3ForFork0_#t~nondet4] {30901#true} is VALID [2022-02-20 20:12:32,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {30901#true} [242] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of3ForFork0_#in~arg.offset_1| v_thr1Thread2of3ForFork0_~arg.offset_1) (= v_thr1Thread2of3ForFork0_~arg.base_1 |v_thr1Thread2of3ForFork0_#in~arg.base_1|)) InVars {thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_1, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_1, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset] {30901#true} is VALID [2022-02-20 20:12:32,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {30901#true} [243] L704-->L704-1: Formula: (and (<= |v_thr1Thread2of3ForFork0_#t~nondet4_1| 2147483647) (<= 0 (+ |v_thr1Thread2of3ForFork0_#t~nondet4_1| 2147483648))) InVars {thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_1|} OutVars{thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {30901#true} is VALID [2022-02-20 20:12:32,324 INFO L290 TraceCheckUtils]: 31: Hoare triple {30901#true} [244] L704-1-->L704-2: Formula: (= v_thr1Thread2of3ForFork0_~l~0_1 |v_thr1Thread2of3ForFork0_#t~nondet4_3|) InVars {thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_3|} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_1, thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0] {30901#true} is VALID [2022-02-20 20:12:32,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {30901#true} [245] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_#t~nondet4] {30901#true} is VALID [2022-02-20 20:12:32,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {30901#true} [246] L705-->L706: Formula: (= v_thr1Thread2of3ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0] {30903#(= thr1Thread2of3ForFork0_~l~0 4)} is VALID [2022-02-20 20:12:32,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {30903#(= thr1Thread2of3ForFork0_~l~0 4)} [232] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of3ForFork0_~arg.base_1 |v_thr1Thread1of3ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of3ForFork0_#in~arg.offset_1| v_thr1Thread1of3ForFork0_~arg.offset_1)) InVars {thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_1, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_1, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~arg.base] {30903#(= thr1Thread2of3ForFork0_~l~0 4)} is VALID [2022-02-20 20:12:32,325 INFO L290 TraceCheckUtils]: 35: Hoare triple {30903#(= thr1Thread2of3ForFork0_~l~0 4)} [233] L704-->L704-1: Formula: (and (<= 0 (+ |v_thr1Thread1of3ForFork0_#t~nondet4_1| 2147483648)) (<= |v_thr1Thread1of3ForFork0_#t~nondet4_1| 2147483647)) InVars {thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_1|} OutVars{thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {30903#(= thr1Thread2of3ForFork0_~l~0 4)} is VALID [2022-02-20 20:12:32,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {30903#(= thr1Thread2of3ForFork0_~l~0 4)} [234] L704-1-->L704-2: Formula: (= |v_thr1Thread1of3ForFork0_#t~nondet4_3| v_thr1Thread1of3ForFork0_~l~0_1) InVars {thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_3|} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_1, thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~l~0] {30903#(= thr1Thread2of3ForFork0_~l~0 4)} is VALID [2022-02-20 20:12:32,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {30903#(= thr1Thread2of3ForFork0_~l~0 4)} [235] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#t~nondet4] {30903#(= thr1Thread2of3ForFork0_~l~0 4)} is VALID [2022-02-20 20:12:32,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {30903#(= thr1Thread2of3ForFork0_~l~0 4)} [236] L705-->L706: Formula: (= v_thr1Thread1of3ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~l~0] {30904#(= thr1Thread2of3ForFork0_~l~0 thr1Thread1of3ForFork0_~l~0)} is VALID [2022-02-20 20:12:32,327 INFO L290 TraceCheckUtils]: 39: Hoare triple {30904#(= thr1Thread2of3ForFork0_~l~0 thr1Thread1of3ForFork0_~l~0)} [237] L706-->L708: Formula: (= v_thr1Thread1of3ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_5} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {30904#(= thr1Thread2of3ForFork0_~l~0 thr1Thread1of3ForFork0_~l~0)} is VALID [2022-02-20 20:12:32,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {30904#(= thr1Thread2of3ForFork0_~l~0 thr1Thread1of3ForFork0_~l~0)} [247] L706-->L708: Formula: (= v_thr1Thread2of3ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_5} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {30905#(= ~s~0 thr1Thread1of3ForFork0_~l~0)} is VALID [2022-02-20 20:12:32,328 INFO L290 TraceCheckUtils]: 41: Hoare triple {30905#(= ~s~0 thr1Thread1of3ForFork0_~l~0)} [238] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread1of3ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {30902#false} is VALID [2022-02-20 20:12:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:12:32,328 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:32,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217420564] [2022-02-20 20:12:32,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217420564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:32,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:32,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 20:12:32,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093130586] [2022-02-20 20:12:32,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:32,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 42 [2022-02-20 20:12:32,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:32,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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:12:32,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:32,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:12:32,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:32,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:12:32,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:12:32,354 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 64 [2022-02-20 20:12:32,355 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 64 transitions, 199 flow. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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:12:32,355 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:32,355 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 64 [2022-02-20 20:12:32,355 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:32,643 INFO L129 PetriNetUnfolder]: 464/1205 cut-off events. [2022-02-20 20:12:32,644 INFO L130 PetriNetUnfolder]: For 794/794 co-relation queries the response was YES. [2022-02-20 20:12:32,647 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3084 conditions, 1205 events. 464/1205 cut-off events. For 794/794 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 8694 event pairs, 91 based on Foata normal form. 10/1068 useless extension candidates. Maximal degree in co-relation 3004. Up to 282 conditions per place. [2022-02-20 20:12:32,654 INFO L132 encePairwiseOnDemand]: 55/64 looper letters, 50 selfloop transitions, 23 changer transitions 0/112 dead transitions. [2022-02-20 20:12:32,655 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 573 flow [2022-02-20 20:12:32,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:12:32,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:12:32,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 371 transitions. [2022-02-20 20:12:32,687 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.828125 [2022-02-20 20:12:32,687 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 371 transitions. [2022-02-20 20:12:32,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 371 transitions. [2022-02-20 20:12:32,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:32,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 371 transitions. [2022-02-20 20:12:32,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 53.0) internal successors, (371), 7 states have internal predecessors, (371), 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:12:32,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 64.0) internal successors, (512), 8 states have internal predecessors, (512), 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:12:32,689 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 64.0) internal successors, (512), 8 states have internal predecessors, (512), 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:12:32,689 INFO L186 Difference]: Start difference. First operand has 70 places, 64 transitions, 199 flow. Second operand 7 states and 371 transitions. [2022-02-20 20:12:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 573 flow [2022-02-20 20:12:33,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:12:33,640 INFO L242 Difference]: Finished difference. Result has 78 places, 83 transitions, 387 flow [2022-02-20 20:12:33,641 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=387, PETRI_PLACES=78, PETRI_TRANSITIONS=83} [2022-02-20 20:12:33,641 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2022-02-20 20:12:33,641 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 83 transitions, 387 flow [2022-02-20 20:12:34,215 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 23832 states, 23796 states have (on average 3.3835518574550343) internal successors, (80515), 23831 states have internal predecessors, (80515), 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:12:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 23832 states, 23796 states have (on average 3.3835518574550343) internal successors, (80515), 23831 states have internal predecessors, (80515), 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 42 [2022-02-20 20:12:34,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:34,269 INFO L470 AbstractCegarLoop]: Abstraction has has 78 places, 83 transitions, 387 flow [2022-02-20 20:12:34,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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:12:34,269 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:34,269 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:34,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 20:12:34,270 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:34,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:34,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1486133546, now seen corresponding path program 2 times [2022-02-20 20:12:34,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:34,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965244031] [2022-02-20 20:12:34,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:34,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:34,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {54750#true} [202] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {54750#true} [185] 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] {54750#true} is VALID [2022-02-20 20:12:34,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {54750#true} [211] 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[] {54750#true} is VALID [2022-02-20 20:12:34,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {54750#true} [213] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {54750#true} [208] L15-->L15-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[] {54750#true} is VALID [2022-02-20 20:12:34,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {54750#true} [196] L15-1-->L15-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[] {54750#true} is VALID [2022-02-20 20:12:34,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {54750#true} [189] L15-2-->L15-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[] {54750#true} is VALID [2022-02-20 20:12:34,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {54750#true} [183] L15-3-->L15-4: Formula: (and (= 18 (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[] {54750#true} is VALID [2022-02-20 20:12:34,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {54750#true} [212] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {54750#true} is VALID [2022-02-20 20:12:34,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {54750#true} [215] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {54750#true} [192] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {54750#true} [199] 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] {54750#true} is VALID [2022-02-20 20:12:34,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {54750#true} [191] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {54750#true} is VALID [2022-02-20 20:12:34,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {54750#true} [195] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {54750#true} [198] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {54750#true} is VALID [2022-02-20 20:12:34,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {54750#true} [181] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {54750#true} is VALID [2022-02-20 20:12:34,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {54750#true} [203] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {54750#true} is VALID [2022-02-20 20:12:34,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {54750#true} [207] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {54750#true} [218] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {54750#true} is VALID [2022-02-20 20:12:34,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {54750#true} [214] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {54750#true} is VALID [2022-02-20 20:12:34,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {54750#true} [186] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {54750#true} is VALID [2022-02-20 20:12:34,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {54750#true} [253] L718-4-->thr1ENTRY: Formula: (and (= |v_thr1Thread1of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread1of3ForFork0_thidvar1_2 0) (= |v_ULTIMATE.start_main_#t~pre6#1_12| v_thr1Thread1of3ForFork0_thidvar0_2) (= |v_thr1Thread1of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_4|, thr1Thread1of3ForFork0_#res.base=|v_thr1Thread1of3ForFork0_#res.base_4|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_4, thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_12, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_12|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_4|, thr1Thread1of3ForFork0_#res.offset=|v_thr1Thread1of3ForFork0_#res.offset_4|, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_4, thr1Thread1of3ForFork0_thidvar1=v_thr1Thread1of3ForFork0_thidvar1_2, thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_8|, thr1Thread1of3ForFork0_thidvar0=v_thr1Thread1of3ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#in~arg.base, thr1Thread1of3ForFork0_#res.base, thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~l~0, thr1Thread1of3ForFork0_#in~arg.offset, thr1Thread1of3ForFork0_#res.offset, thr1Thread1of3ForFork0_~arg.base, thr1Thread1of3ForFork0_thidvar1, thr1Thread1of3ForFork0_#t~nondet4, thr1Thread1of3ForFork0_thidvar0] {54750#true} is VALID [2022-02-20 20:12:34,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {54750#true} [232] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of3ForFork0_~arg.base_1 |v_thr1Thread1of3ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of3ForFork0_#in~arg.offset_1| v_thr1Thread1of3ForFork0_~arg.offset_1)) InVars {thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread1of3ForFork0_#in~arg.base=|v_thr1Thread1of3ForFork0_#in~arg.base_1|, thr1Thread1of3ForFork0_~arg.offset=v_thr1Thread1of3ForFork0_~arg.offset_1, thr1Thread1of3ForFork0_~arg.base=v_thr1Thread1of3ForFork0_~arg.base_1, thr1Thread1of3ForFork0_#in~arg.offset=|v_thr1Thread1of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~arg.offset, thr1Thread1of3ForFork0_~arg.base] {54750#true} is VALID [2022-02-20 20:12:34,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {54750#true} [233] L704-->L704-1: Formula: (and (<= 0 (+ |v_thr1Thread1of3ForFork0_#t~nondet4_1| 2147483648)) (<= |v_thr1Thread1of3ForFork0_#t~nondet4_1| 2147483647)) InVars {thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_1|} OutVars{thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {54750#true} [219] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {54750#true} is VALID [2022-02-20 20:12:34,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {54750#true} [210] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {54750#true} is VALID [2022-02-20 20:12:34,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {54750#true} [207] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {54750#true} [218] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {54750#true} is VALID [2022-02-20 20:12:34,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {54750#true} [214] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {54750#true} is VALID [2022-02-20 20:12:34,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {54750#true} [186] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {54750#true} is VALID [2022-02-20 20:12:34,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {54750#true} [254] L718-4-->thr1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_14| v_thr1Thread2of3ForFork0_thidvar0_2) (= |v_thr1Thread2of3ForFork0_#in~arg.offset_4| 0) (= v_thr1Thread2of3ForFork0_thidvar1_2 0) (= |v_thr1Thread2of3ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_14|} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_12, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_14|, thr1Thread2of3ForFork0_#res.base=|v_thr1Thread2of3ForFork0_#res.base_4|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_4|, thr1Thread2of3ForFork0_thidvar1=v_thr1Thread2of3ForFork0_thidvar1_2, thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_4, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_4, thr1Thread2of3ForFork0_#res.offset=|v_thr1Thread2of3ForFork0_#res.offset_4|, thr1Thread2of3ForFork0_thidvar0=v_thr1Thread2of3ForFork0_thidvar0_2, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_4|, thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_8|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0, thr1Thread2of3ForFork0_#res.base, thr1Thread2of3ForFork0_#in~arg.offset, thr1Thread2of3ForFork0_thidvar1, thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset, thr1Thread2of3ForFork0_#res.offset, thr1Thread2of3ForFork0_thidvar0, thr1Thread2of3ForFork0_#in~arg.base, thr1Thread2of3ForFork0_#t~nondet4] {54750#true} is VALID [2022-02-20 20:12:34,371 INFO L290 TraceCheckUtils]: 31: Hoare triple {54750#true} [242] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of3ForFork0_#in~arg.offset_1| v_thr1Thread2of3ForFork0_~arg.offset_1) (= v_thr1Thread2of3ForFork0_~arg.base_1 |v_thr1Thread2of3ForFork0_#in~arg.base_1|)) InVars {thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} OutVars{thr1Thread2of3ForFork0_~arg.base=v_thr1Thread2of3ForFork0_~arg.base_1, thr1Thread2of3ForFork0_~arg.offset=v_thr1Thread2of3ForFork0_~arg.offset_1, thr1Thread2of3ForFork0_#in~arg.base=|v_thr1Thread2of3ForFork0_#in~arg.base_1|, thr1Thread2of3ForFork0_#in~arg.offset=|v_thr1Thread2of3ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~arg.base, thr1Thread2of3ForFork0_~arg.offset] {54750#true} is VALID [2022-02-20 20:12:34,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {54750#true} [243] L704-->L704-1: Formula: (and (<= |v_thr1Thread2of3ForFork0_#t~nondet4_1| 2147483647) (<= 0 (+ |v_thr1Thread2of3ForFork0_#t~nondet4_1| 2147483648))) InVars {thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_1|} OutVars{thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {54750#true} is VALID [2022-02-20 20:12:34,372 INFO L290 TraceCheckUtils]: 33: Hoare triple {54750#true} [244] L704-1-->L704-2: Formula: (= v_thr1Thread2of3ForFork0_~l~0_1 |v_thr1Thread2of3ForFork0_#t~nondet4_3|) InVars {thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_3|} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_1, thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0] {54750#true} is VALID [2022-02-20 20:12:34,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {54750#true} [234] L704-1-->L704-2: Formula: (= |v_thr1Thread1of3ForFork0_#t~nondet4_3| v_thr1Thread1of3ForFork0_~l~0_1) InVars {thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_3|} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_1, thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~l~0] {54750#true} is VALID [2022-02-20 20:12:34,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {54750#true} [235] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread1of3ForFork0_#t~nondet4=|v_thr1Thread1of3ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_#t~nondet4] {54750#true} is VALID [2022-02-20 20:12:34,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {54750#true} [236] L705-->L706: Formula: (= v_thr1Thread1of3ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread1of3ForFork0_~l~0] {54752#(and (<= thr1Thread1of3ForFork0_~l~0 4) (<= 4 thr1Thread1of3ForFork0_~l~0))} is VALID [2022-02-20 20:12:34,373 INFO L290 TraceCheckUtils]: 37: Hoare triple {54752#(and (<= thr1Thread1of3ForFork0_~l~0 4) (<= 4 thr1Thread1of3ForFork0_~l~0))} [237] L706-->L708: Formula: (= v_thr1Thread1of3ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_5} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {54752#(and (<= thr1Thread1of3ForFork0_~l~0 4) (<= 4 thr1Thread1of3ForFork0_~l~0))} is VALID [2022-02-20 20:12:34,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {54752#(and (<= thr1Thread1of3ForFork0_~l~0 4) (<= 4 thr1Thread1of3ForFork0_~l~0))} [245] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread2of3ForFork0_#t~nondet4=|v_thr1Thread2of3ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_#t~nondet4] {54752#(and (<= thr1Thread1of3ForFork0_~l~0 4) (<= 4 thr1Thread1of3ForFork0_~l~0))} is VALID [2022-02-20 20:12:34,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {54752#(and (<= thr1Thread1of3ForFork0_~l~0 4) (<= 4 thr1Thread1of3ForFork0_~l~0))} [246] L705-->L706: Formula: (= v_thr1Thread2of3ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread2of3ForFork0_~l~0] {54753#(and (<= thr1Thread2of3ForFork0_~l~0 thr1Thread1of3ForFork0_~l~0) (<= thr1Thread1of3ForFork0_~l~0 thr1Thread2of3ForFork0_~l~0))} is VALID [2022-02-20 20:12:34,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {54753#(and (<= thr1Thread2of3ForFork0_~l~0 thr1Thread1of3ForFork0_~l~0) (<= thr1Thread1of3ForFork0_~l~0 thr1Thread2of3ForFork0_~l~0))} [247] L706-->L708: Formula: (= v_thr1Thread2of3ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_5} OutVars{thr1Thread2of3ForFork0_~l~0=v_thr1Thread2of3ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {54754#(and (<= thr1Thread1of3ForFork0_~l~0 ~s~0) (< ~s~0 (+ thr1Thread1of3ForFork0_~l~0 1)))} is VALID [2022-02-20 20:12:34,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {54754#(and (<= thr1Thread1of3ForFork0_~l~0 ~s~0) (< ~s~0 (+ thr1Thread1of3ForFork0_~l~0 1)))} [238] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread1of3ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread1of3ForFork0_~l~0=v_thr1Thread1of3ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {54751#false} is VALID [2022-02-20 20:12:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:12:34,377 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:34,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965244031] [2022-02-20 20:12:34,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965244031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:34,377 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:34,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 20:12:34,378 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073825104] [2022-02-20 20:12:34,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:34,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 42 [2022-02-20 20:12:34,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:34,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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:12:34,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:34,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:12:34,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:12:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:12:34,401 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 64 [2022-02-20 20:12:34,401 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 83 transitions, 387 flow. Second operand has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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:12:34,401 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:34,401 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 64 [2022-02-20 20:12:34,402 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:35,141 INFO L129 PetriNetUnfolder]: 441/1220 cut-off events. [2022-02-20 20:12:35,142 INFO L130 PetriNetUnfolder]: For 1541/1541 co-relation queries the response was YES. [2022-02-20 20:12:35,145 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3624 conditions, 1220 events. 441/1220 cut-off events. For 1541/1541 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9115 event pairs, 114 based on Foata normal form. 20/1129 useless extension candidates. Maximal degree in co-relation 3538. Up to 241 conditions per place. [2022-02-20 20:12:35,150 INFO L132 encePairwiseOnDemand]: 55/64 looper letters, 52 selfloop transitions, 26 changer transitions 0/117 dead transitions. [2022-02-20 20:12:35,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 734 flow [2022-02-20 20:12:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 20:12:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-02-20 20:12:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 322 transitions. [2022-02-20 20:12:35,153 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8385416666666666 [2022-02-20 20:12:35,153 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 322 transitions. [2022-02-20 20:12:35,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 322 transitions. [2022-02-20 20:12:35,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:35,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 322 transitions. [2022-02-20 20:12:35,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 53.666666666666664) internal successors, (322), 6 states have internal predecessors, (322), 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:12:35,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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:12:35,155 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 64.0) internal successors, (448), 7 states have internal predecessors, (448), 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:12:35,155 INFO L186 Difference]: Start difference. First operand has 78 places, 83 transitions, 387 flow. Second operand 6 states and 322 transitions. [2022-02-20 20:12:35,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 734 flow [2022-02-20 20:12:50,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 732 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:50,922 INFO L242 Difference]: Finished difference. Result has 87 places, 92 transitions, 574 flow [2022-02-20 20:12:50,922 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=64, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=574, PETRI_PLACES=87, PETRI_TRANSITIONS=92} [2022-02-20 20:12:50,923 INFO L334 CegarLoopForPetriNet]: 70 programPoint places, 17 predicate places. [2022-02-20 20:12:50,923 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 87 places, 92 transitions, 574 flow [2022-02-20 20:12:51,647 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 25207 states, 25163 states have (on average 3.34749433692326) internal successors, (84233), 25206 states have internal predecessors, (84233), 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:12:51,689 INFO L78 Accepts]: Start accepts. Automaton has has 25207 states, 25163 states have (on average 3.34749433692326) internal successors, (84233), 25206 states have internal predecessors, (84233), 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 42 [2022-02-20 20:12:51,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:51,690 INFO L470 AbstractCegarLoop]: Abstraction has has 87 places, 92 transitions, 574 flow [2022-02-20 20:12:51,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.2) internal successors, (231), 5 states have internal predecessors, (231), 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:12:51,690 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:51,690 INFO L254 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 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:12:51,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 20:12:51,691 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2022-02-20 20:12:51,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:51,691 INFO L85 PathProgramCache]: Analyzing trace with hash -468720811, now seen corresponding path program 1 times [2022-02-20 20:12:51,691 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:51,691 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540927513] [2022-02-20 20:12:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:51,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 20:12:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 20:12:51,731 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 20:12:51,734 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 20:12:51,734 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 5 remaining) [2022-02-20 20:12:51,734 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-02-20 20:12:51,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-02-20 20:12:51,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-02-20 20:12:51,735 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-02-20 20:12:51,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 20:12:51,736 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-02-20 20:12:51,737 WARN L235 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2022-02-20 20:12:51,737 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,747 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,748 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,749 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,750 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,750 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,750 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,750 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,750 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,750 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,751 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,752 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,752 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,753 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,753 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,753 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,753 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,754 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,754 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,754 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,754 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,754 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,754 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,754 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,758 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,759 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,759 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,760 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,761 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,763 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,763 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,763 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,763 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,764 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,764 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,764 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,764 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,764 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,765 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,766 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,766 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,767 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,767 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,767 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,767 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,767 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,768 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,768 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,768 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,768 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,768 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,768 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,768 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,769 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,770 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,770 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,770 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,770 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,770 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,771 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,772 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,772 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,772 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,773 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,773 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,773 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,773 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,773 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,773 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,774 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,775 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,775 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,775 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,775 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,776 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,776 WARN L322 ript$VariableManager]: TermVariabe thr1Thread1of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,776 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread1of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,776 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,777 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,777 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,777 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,777 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread2of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,777 WARN L322 ript$VariableManager]: TermVariabe thr1Thread2of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,778 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,778 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,778 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,779 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,779 WARN L322 ript$VariableManager]: TermVariabe thr1Thread3of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,779 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread3of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,779 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,779 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,779 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,780 WARN L322 ript$VariableManager]: TermVariabe |thr1Thread4of4ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,780 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,780 WARN L322 ript$VariableManager]: TermVariabe thr1Thread4of4ForFork0_~l~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-02-20 20:12:51,780 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-02-20 20:12:51,781 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 20:12:51,782 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:12:51,782 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-02-20 20:12:51,783 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 83 places, 75 transitions, 182 flow [2022-02-20 20:12:51,793 INFO L129 PetriNetUnfolder]: 5/125 cut-off events. [2022-02-20 20:12:51,793 INFO L130 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-02-20 20:12:51,793 INFO L84 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 125 events. 5/125 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 217 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 109. Up to 10 conditions per place. [2022-02-20 20:12:51,793 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 75 transitions, 182 flow [2022-02-20 20:12:51,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 75 transitions, 182 flow [2022-02-20 20:12:51,796 INFO L129 PetriNetUnfolder]: 2/47 cut-off events. [2022-02-20 20:12:51,796 INFO L130 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2022-02-20 20:12:51,796 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:51,796 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] [2022-02-20 20:12:51,796 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:12:51,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:51,797 INFO L85 PathProgramCache]: Analyzing trace with hash -456275018, now seen corresponding path program 1 times [2022-02-20 20:12:51,797 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:51,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350009371] [2022-02-20 20:12:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:51,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:51,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {86#true} [277] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:12:51,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {86#true} [260] 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] {86#true} is VALID [2022-02-20 20:12:51,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {86#true} [286] 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[] {86#true} is VALID [2022-02-20 20:12:51,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {86#true} [288] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:12:51,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {86#true} [283] L15-->L15-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[] {86#true} is VALID [2022-02-20 20:12:51,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {86#true} [271] L15-1-->L15-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[] {86#true} is VALID [2022-02-20 20:12:51,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {86#true} [264] L15-2-->L15-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[] {86#true} is VALID [2022-02-20 20:12:51,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {86#true} [258] L15-3-->L15-4: Formula: (and (= 18 (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[] {86#true} is VALID [2022-02-20 20:12:51,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {86#true} [287] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {86#true} is VALID [2022-02-20 20:12:51,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {86#true} [290] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:12:51,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {86#true} [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:12:51,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {86#true} [274] 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] {86#true} is VALID [2022-02-20 20:12:51,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {86#true} [266] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {86#true} is VALID [2022-02-20 20:12:51,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {86#true} [270] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:12:51,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {86#true} [273] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {86#true} is VALID [2022-02-20 20:12:51,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {86#true} [256] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {86#true} is VALID [2022-02-20 20:12:51,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {86#true} [278] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {86#true} is VALID [2022-02-20 20:12:51,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {86#true} [282] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:12:51,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {86#true} [293] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {86#true} is VALID [2022-02-20 20:12:51,821 INFO L290 TraceCheckUtils]: 19: Hoare triple {86#true} [289] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {86#true} is VALID [2022-02-20 20:12:51,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {86#true} [261] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {86#true} is VALID [2022-02-20 20:12:51,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {86#true} [338] L718-4-->thr1ENTRY: Formula: (and (= v_thr1Thread1of4ForFork0_thidvar1_2 0) (= |v_thr1Thread1of4ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_18| v_thr1Thread1of4ForFork0_thidvar0_2) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_18|} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_12, thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_8|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_18|, thr1Thread1of4ForFork0_thidvar1=v_thr1Thread1of4ForFork0_thidvar1_2, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_4, thr1Thread1of4ForFork0_#res.offset=|v_thr1Thread1of4ForFork0_#res.offset_4|, thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_4, thr1Thread1of4ForFork0_#res.base=|v_thr1Thread1of4ForFork0_#res.base_4|, thr1Thread1of4ForFork0_thidvar0=v_thr1Thread1of4ForFork0_thidvar0_2, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_4|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~l~0, thr1Thread1of4ForFork0_#t~nondet4, thr1Thread1of4ForFork0_thidvar1, thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_#res.offset, thr1Thread1of4ForFork0_~arg.base, thr1Thread1of4ForFork0_#res.base, thr1Thread1of4ForFork0_thidvar0, thr1Thread1of4ForFork0_#in~arg.base, thr1Thread1of4ForFork0_#in~arg.offset] {86#true} is VALID [2022-02-20 20:12:51,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {86#true} [317] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of4ForFork0_~arg.base_1 |v_thr1Thread1of4ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_1| v_thr1Thread1of4ForFork0_~arg.offset_1)) InVars {thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_1, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_~arg.base] {86#true} is VALID [2022-02-20 20:12:51,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {86#true} [318] L704-->L704-1: Formula: (and (<= |v_thr1Thread1of4ForFork0_#t~nondet4_1| 2147483647) (<= 0 (+ |v_thr1Thread1of4ForFork0_#t~nondet4_1| 2147483648))) InVars {thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_1|} OutVars{thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {86#true} is VALID [2022-02-20 20:12:51,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {86#true} [319] L704-1-->L704-2: Formula: (= v_thr1Thread1of4ForFork0_~l~0_1 |v_thr1Thread1of4ForFork0_#t~nondet4_3|) InVars {thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_3|} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_1, thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~l~0] {86#true} is VALID [2022-02-20 20:12:51,826 INFO L290 TraceCheckUtils]: 25: Hoare triple {86#true} [320] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#t~nondet4] {86#true} is VALID [2022-02-20 20:12:51,826 INFO L290 TraceCheckUtils]: 26: Hoare triple {86#true} [321] L705-->L706: Formula: (= v_thr1Thread1of4ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~l~0] {86#true} is VALID [2022-02-20 20:12:51,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {86#true} [322] L706-->L708: Formula: (= v_thr1Thread1of4ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_5} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {88#(= ~s~0 thr1Thread1of4ForFork0_~l~0)} is VALID [2022-02-20 20:12:51,827 INFO L290 TraceCheckUtils]: 28: Hoare triple {88#(= ~s~0 thr1Thread1of4ForFork0_~l~0)} [323] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread1of4ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {87#false} is VALID [2022-02-20 20:12:51,827 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:12:51,827 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:51,827 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350009371] [2022-02-20 20:12:51,827 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350009371] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:51,828 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:51,828 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:51,828 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155005130] [2022-02-20 20:12:51,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:51,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-02-20 20:12:51,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:51,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 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:12:51,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:51,844 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:51,844 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:51,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:51,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:51,846 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 75 [2022-02-20 20:12:51,846 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:12:51,846 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:51,846 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 75 [2022-02-20 20:12:51,846 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:52,116 INFO L129 PetriNetUnfolder]: 1344/2642 cut-off events. [2022-02-20 20:12:52,116 INFO L130 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2022-02-20 20:12:52,125 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 2642 events. 1344/2642 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 19115 event pairs, 870 based on Foata normal form. 669/2762 useless extension candidates. Maximal degree in co-relation 3515. Up to 1494 conditions per place. [2022-02-20 20:12:52,141 INFO L132 encePairwiseOnDemand]: 67/75 looper letters, 28 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2022-02-20 20:12:52,141 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 81 transitions, 281 flow [2022-02-20 20:12:52,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2022-02-20 20:12:52,143 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8755555555555555 [2022-02-20 20:12:52,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2022-02-20 20:12:52,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2022-02-20 20:12:52,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:52,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2022-02-20 20:12:52,144 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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:12:52,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:12:52,145 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:12:52,145 INFO L186 Difference]: Start difference. First operand has 83 places, 75 transitions, 182 flow. Second operand 3 states and 197 transitions. [2022-02-20 20:12:52,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 81 transitions, 281 flow [2022-02-20 20:12:52,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 81 transitions, 263 flow, removed 9 selfloop flow, removed 0 redundant places. [2022-02-20 20:12:52,155 INFO L242 Difference]: Finished difference. Result has 81 places, 72 transitions, 194 flow [2022-02-20 20:12:52,155 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=81, PETRI_TRANSITIONS=72} [2022-02-20 20:12:52,157 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, -2 predicate places. [2022-02-20 20:12:52,157 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 72 transitions, 194 flow [2022-02-20 20:12:56,233 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 163562 states, 163538 states have (on average 4.391566486076631) internal successors, (718188), 163561 states have internal predecessors, (718188), 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:12:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 163562 states, 163538 states have (on average 4.391566486076631) internal successors, (718188), 163561 states have internal predecessors, (718188), 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 29 [2022-02-20 20:12:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:12:56,634 INFO L470 AbstractCegarLoop]: Abstraction has has 81 places, 72 transitions, 194 flow [2022-02-20 20:12:56,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.333333333333336) internal successors, (166), 3 states have internal predecessors, (166), 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:12:56,634 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:12:56,634 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 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:12:56,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 20:12:56,634 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:12:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:12:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1917209497, now seen corresponding path program 1 times [2022-02-20 20:12:56,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:12:56,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297401872] [2022-02-20 20:12:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:12:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:12:56,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:12:56,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {163655#true} [277] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {163655#true} [260] 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] {163655#true} is VALID [2022-02-20 20:12:56,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {163655#true} [286] 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[] {163655#true} is VALID [2022-02-20 20:12:56,681 INFO L290 TraceCheckUtils]: 3: Hoare triple {163655#true} [288] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,681 INFO L290 TraceCheckUtils]: 4: Hoare triple {163655#true} [283] L15-->L15-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[] {163655#true} is VALID [2022-02-20 20:12:56,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {163655#true} [271] L15-1-->L15-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[] {163655#true} is VALID [2022-02-20 20:12:56,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {163655#true} [264] L15-2-->L15-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[] {163655#true} is VALID [2022-02-20 20:12:56,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {163655#true} [258] L15-3-->L15-4: Formula: (and (= 18 (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[] {163655#true} is VALID [2022-02-20 20:12:56,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {163655#true} [287] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {163655#true} is VALID [2022-02-20 20:12:56,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {163655#true} [290] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {163655#true} [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {163655#true} [274] 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] {163655#true} is VALID [2022-02-20 20:12:56,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {163655#true} [266] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {163655#true} is VALID [2022-02-20 20:12:56,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {163655#true} [270] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {163655#true} [273] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {163655#true} is VALID [2022-02-20 20:12:56,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {163655#true} [256] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {163655#true} is VALID [2022-02-20 20:12:56,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {163655#true} [278] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {163655#true} is VALID [2022-02-20 20:12:56,683 INFO L290 TraceCheckUtils]: 17: Hoare triple {163655#true} [282] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {163655#true} [293] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {163655#true} is VALID [2022-02-20 20:12:56,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {163655#true} [289] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {163655#true} is VALID [2022-02-20 20:12:56,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {163655#true} [261] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {163655#true} is VALID [2022-02-20 20:12:56,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {163655#true} [338] L718-4-->thr1ENTRY: Formula: (and (= v_thr1Thread1of4ForFork0_thidvar1_2 0) (= |v_thr1Thread1of4ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_18| v_thr1Thread1of4ForFork0_thidvar0_2) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_18|} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_12, thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_8|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_18|, thr1Thread1of4ForFork0_thidvar1=v_thr1Thread1of4ForFork0_thidvar1_2, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_4, thr1Thread1of4ForFork0_#res.offset=|v_thr1Thread1of4ForFork0_#res.offset_4|, thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_4, thr1Thread1of4ForFork0_#res.base=|v_thr1Thread1of4ForFork0_#res.base_4|, thr1Thread1of4ForFork0_thidvar0=v_thr1Thread1of4ForFork0_thidvar0_2, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_4|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~l~0, thr1Thread1of4ForFork0_#t~nondet4, thr1Thread1of4ForFork0_thidvar1, thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_#res.offset, thr1Thread1of4ForFork0_~arg.base, thr1Thread1of4ForFork0_#res.base, thr1Thread1of4ForFork0_thidvar0, thr1Thread1of4ForFork0_#in~arg.base, thr1Thread1of4ForFork0_#in~arg.offset] {163655#true} is VALID [2022-02-20 20:12:56,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {163655#true} [294] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {163655#true} is VALID [2022-02-20 20:12:56,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {163655#true} [285] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {163655#true} is VALID [2022-02-20 20:12:56,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {163655#true} [282] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {163655#true} [293] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {163655#true} is VALID [2022-02-20 20:12:56,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {163655#true} [289] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {163655#true} is VALID [2022-02-20 20:12:56,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {163655#true} [261] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {163655#true} is VALID [2022-02-20 20:12:56,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {163655#true} [339] L718-4-->thr1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_20| v_thr1Thread2of4ForFork0_thidvar0_2) (= v_thr1Thread2of4ForFork0_thidvar1_2 0) (= |v_thr1Thread2of4ForFork0_#in~arg.offset_4| 0) (= |v_thr1Thread2of4ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_20|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_20|, thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_8|, thr1Thread2of4ForFork0_~arg.base=v_thr1Thread2of4ForFork0_~arg.base_4, thr1Thread2of4ForFork0_~arg.offset=v_thr1Thread2of4ForFork0_~arg.offset_4, thr1Thread2of4ForFork0_#res.base=|v_thr1Thread2of4ForFork0_#res.base_4|, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_4|, thr1Thread2of4ForFork0_#res.offset=|v_thr1Thread2of4ForFork0_#res.offset_4|, thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_12, thr1Thread2of4ForFork0_thidvar1=v_thr1Thread2of4ForFork0_thidvar1_2, thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_4|, thr1Thread2of4ForFork0_thidvar0=v_thr1Thread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#t~nondet4, thr1Thread2of4ForFork0_~arg.base, thr1Thread2of4ForFork0_~arg.offset, thr1Thread2of4ForFork0_#res.base, thr1Thread2of4ForFork0_#in~arg.base, thr1Thread2of4ForFork0_#res.offset, thr1Thread2of4ForFork0_~l~0, thr1Thread2of4ForFork0_thidvar1, thr1Thread2of4ForFork0_#in~arg.offset, thr1Thread2of4ForFork0_thidvar0] {163655#true} is VALID [2022-02-20 20:12:56,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {163655#true} [327] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of4ForFork0_#in~arg.base_1| v_thr1Thread2of4ForFork0_~arg.base_1) (= v_thr1Thread2of4ForFork0_~arg.offset_1 |v_thr1Thread2of4ForFork0_#in~arg.offset_1|)) InVars {thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_1|, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_1|} OutVars{thr1Thread2of4ForFork0_~arg.offset=v_thr1Thread2of4ForFork0_~arg.offset_1, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_1|, thr1Thread2of4ForFork0_~arg.base=v_thr1Thread2of4ForFork0_~arg.base_1, thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~arg.base, thr1Thread2of4ForFork0_~arg.offset] {163655#true} is VALID [2022-02-20 20:12:56,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {163655#true} [328] L704-->L704-1: Formula: (and (<= 0 (+ |v_thr1Thread2of4ForFork0_#t~nondet4_1| 2147483648)) (<= |v_thr1Thread2of4ForFork0_#t~nondet4_1| 2147483647)) InVars {thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_1|} OutVars{thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {163655#true} is VALID [2022-02-20 20:12:56,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {163655#true} [329] L704-1-->L704-2: Formula: (= |v_thr1Thread2of4ForFork0_#t~nondet4_3| v_thr1Thread2of4ForFork0_~l~0_1) InVars {thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_3|, thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_1} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~l~0] {163655#true} is VALID [2022-02-20 20:12:56,689 INFO L290 TraceCheckUtils]: 32: Hoare triple {163655#true} [330] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#t~nondet4] {163655#true} is VALID [2022-02-20 20:12:56,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {163655#true} [331] L705-->L706: Formula: (= v_thr1Thread2of4ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~l~0] {163655#true} is VALID [2022-02-20 20:12:56,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {163655#true} [332] L706-->L708: Formula: (= v_thr1Thread2of4ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_5} OutVars{thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {163657#(= (+ (* (- 1) ~s~0) thr1Thread2of4ForFork0_~l~0) 0)} is VALID [2022-02-20 20:12:56,692 INFO L290 TraceCheckUtils]: 35: Hoare triple {163657#(= (+ (* (- 1) ~s~0) thr1Thread2of4ForFork0_~l~0) 0)} [333] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread2of4ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {163656#false} is VALID [2022-02-20 20:12:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:12:56,692 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:12:56,692 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297401872] [2022-02-20 20:12:56,692 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297401872] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:12:56,692 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:12:56,692 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 20:12:56,693 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942600041] [2022-02-20 20:12:56,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:12:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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 36 [2022-02-20 20:12:56,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:12:56,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 16.0) internal successors, (32), 3 states have internal predecessors, (32), 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:12:56,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:12:56,709 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 20:12:56,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:12:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 20:12:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 20:12:56,710 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 75 [2022-02-20 20:12:56,711 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 72 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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:12:56,711 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:12:56,711 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 75 [2022-02-20 20:12:56,711 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:12:57,153 INFO L129 PetriNetUnfolder]: 1768/3569 cut-off events. [2022-02-20 20:12:57,153 INFO L130 PetriNetUnfolder]: For 2165/2165 co-relation queries the response was YES. [2022-02-20 20:12:57,162 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8437 conditions, 3569 events. 1768/3569 cut-off events. For 2165/2165 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 27730 event pairs, 936 based on Foata normal form. 0/3024 useless extension candidates. Maximal degree in co-relation 8372. Up to 2004 conditions per place. [2022-02-20 20:12:57,189 INFO L132 encePairwiseOnDemand]: 69/75 looper letters, 31 selfloop transitions, 8 changer transitions 0/87 dead transitions. [2022-02-20 20:12:57,189 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 87 transitions, 336 flow [2022-02-20 20:12:57,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 20:12:57,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-02-20 20:12:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 20:12:57,191 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8533333333333334 [2022-02-20 20:12:57,191 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 192 transitions. [2022-02-20 20:12:57,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 192 transitions. [2022-02-20 20:12:57,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:12:57,192 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 192 transitions. [2022-02-20 20:12:57,192 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 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:12:57,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:12:57,193 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:12:57,193 INFO L186 Difference]: Start difference. First operand has 81 places, 72 transitions, 194 flow. Second operand 3 states and 192 transitions. [2022-02-20 20:12:57,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 87 transitions, 336 flow [2022-02-20 20:13:01,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-02-20 20:13:01,387 INFO L242 Difference]: Finished difference. Result has 83 places, 78 transitions, 252 flow [2022-02-20 20:13:01,387 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=83, PETRI_TRANSITIONS=78} [2022-02-20 20:13:01,388 INFO L334 CegarLoopForPetriNet]: 83 programPoint places, 0 predicate places. [2022-02-20 20:13:01,388 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 78 transitions, 252 flow [2022-02-20 20:13:06,435 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 207095 states, 207059 states have (on average 4.340811073172381) internal successors, (898804), 207094 states have internal predecessors, (898804), 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:13:06,771 INFO L78 Accepts]: Start accepts. Automaton has has 207095 states, 207059 states have (on average 4.340811073172381) internal successors, (898804), 207094 states have internal predecessors, (898804), 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 36 [2022-02-20 20:13:06,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 20:13:06,772 INFO L470 AbstractCegarLoop]: Abstraction has has 83 places, 78 transitions, 252 flow [2022-02-20 20:13:06,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 3 states have internal predecessors, (167), 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:13:06,772 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-02-20 20:13:06,772 INFO L254 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:06,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 20:13:06,773 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-02-20 20:13:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 20:13:06,773 INFO L85 PathProgramCache]: Analyzing trace with hash -870085120, now seen corresponding path program 1 times [2022-02-20 20:13:06,774 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 20:13:06,774 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616678082] [2022-02-20 20:13:06,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 20:13:06,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 20:13:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 20:13:06,907 INFO L290 TraceCheckUtils]: 0: Hoare triple {370757#true} [277] ULTIMATE.startENTRY-->L-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {370757#true} [260] 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] {370757#true} is VALID [2022-02-20 20:13:06,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {370757#true} [286] 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[] {370757#true} is VALID [2022-02-20 20:13:06,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {370757#true} [288] L-1-2-->L15: Formula: (< 0 |v_#StackHeapBarrier_1|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,909 INFO L290 TraceCheckUtils]: 4: Hoare triple {370757#true} [283] L15-->L15-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[] {370757#true} is VALID [2022-02-20 20:13:06,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {370757#true} [271] L15-1-->L15-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[] {370757#true} is VALID [2022-02-20 20:13:06,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {370757#true} [264] L15-2-->L15-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[] {370757#true} is VALID [2022-02-20 20:13:06,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {370757#true} [258] L15-3-->L15-4: Formula: (and (= 18 (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[] {370757#true} is VALID [2022-02-20 20:13:06,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {370757#true} [287] L15-4-->L-1-3: Formula: (= v_~s~0_4 0) InVars {} OutVars{~s~0=v_~s~0_4} AuxVars[] AssignedVars[~s~0] {370757#true} is VALID [2022-02-20 20:13:06,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {370757#true} [290] L-1-3-->L-1-4: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {370757#true} [267] L-1-4-->L-1-5: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {370757#true} [274] 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] {370757#true} is VALID [2022-02-20 20:13:06,914 INFO L290 TraceCheckUtils]: 12: Hoare triple {370757#true} [266] L-1-6-->L716: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_1|, ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_1|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_~#t~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_~#t~0#1.base] {370757#true} is VALID [2022-02-20 20:13:06,914 INFO L290 TraceCheckUtils]: 13: Hoare triple {370757#true} [270] L716-->L716-1: Formula: (and (<= 0 (+ |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483648)) (<= |v_ULTIMATE.start_main_#t~nondet5#1_2| 2147483647)) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_2|} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,914 INFO L290 TraceCheckUtils]: 14: Hoare triple {370757#true} [273] L716-1-->L716-2: Formula: (= |v_ULTIMATE.start_main_#t~nondet5#1_3| v_~s~0_5) InVars {ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_3|, ~s~0=v_~s~0_5} AuxVars[] AssignedVars[~s~0] {370757#true} is VALID [2022-02-20 20:13:06,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {370757#true} [256] L716-2-->L717: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet5#1=|v_ULTIMATE.start_main_#t~nondet5#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet5#1] {370757#true} is VALID [2022-02-20 20:13:06,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {370757#true} [278] L717-->L718-7: Formula: (and (not (= |v_ULTIMATE.start_main_~#t~0#1.base_2| 0)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t~0#1.offset_2| 0) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t~0#1.base_2| 4)) (= |v_#valid_4| (store |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2| 1)) (= (select |v_#valid_5| |v_ULTIMATE.start_main_~#t~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_5|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_2|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_2|, #valid=|v_#valid_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t~0#1.base] {370757#true} is VALID [2022-02-20 20:13:06,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {370757#true} [282] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {370757#true} [293] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {370757#true} is VALID [2022-02-20 20:13:06,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {370757#true} [289] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {370757#true} is VALID [2022-02-20 20:13:06,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {370757#true} [261] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {370757#true} is VALID [2022-02-20 20:13:06,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {370757#true} [338] L718-4-->thr1ENTRY: Formula: (and (= v_thr1Thread1of4ForFork0_thidvar1_2 0) (= |v_thr1Thread1of4ForFork0_#in~arg.base_4| 0) (= |v_ULTIMATE.start_main_#t~pre6#1_18| v_thr1Thread1of4ForFork0_thidvar0_2) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_18|} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_12, thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_8|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_18|, thr1Thread1of4ForFork0_thidvar1=v_thr1Thread1of4ForFork0_thidvar1_2, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_4, thr1Thread1of4ForFork0_#res.offset=|v_thr1Thread1of4ForFork0_#res.offset_4|, thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_4, thr1Thread1of4ForFork0_#res.base=|v_thr1Thread1of4ForFork0_#res.base_4|, thr1Thread1of4ForFork0_thidvar0=v_thr1Thread1of4ForFork0_thidvar0_2, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_4|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_4|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~l~0, thr1Thread1of4ForFork0_#t~nondet4, thr1Thread1of4ForFork0_thidvar1, thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_#res.offset, thr1Thread1of4ForFork0_~arg.base, thr1Thread1of4ForFork0_#res.base, thr1Thread1of4ForFork0_thidvar0, thr1Thread1of4ForFork0_#in~arg.base, thr1Thread1of4ForFork0_#in~arg.offset] {370757#true} is VALID [2022-02-20 20:13:06,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {370757#true} [294] L718-5-->L718-6: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {370757#true} is VALID [2022-02-20 20:13:06,916 INFO L290 TraceCheckUtils]: 23: Hoare triple {370757#true} [285] L718-6-->L718-7: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet7#1] {370757#true} is VALID [2022-02-20 20:13:06,916 INFO L290 TraceCheckUtils]: 24: Hoare triple {370757#true} [282] L718-7-->L718-1: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {370757#true} [293] L718-1-->L718-2: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] {370757#true} is VALID [2022-02-20 20:13:06,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {370757#true} [289] L718-2-->L718-3: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] {370757#true} is VALID [2022-02-20 20:13:06,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {370757#true} [261] L718-3-->L718-4: Formula: (= (store |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3| (store (select |v_#memory_int_4| |v_ULTIMATE.start_main_~#t~0#1.base_3|) |v_ULTIMATE.start_main_~#t~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_3|) InVars {#memory_int=|v_#memory_int_4|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} OutVars{#memory_int=|v_#memory_int_3|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, ULTIMATE.start_main_~#t~0#1.base=|v_ULTIMATE.start_main_~#t~0#1.base_3|, ULTIMATE.start_main_~#t~0#1.offset=|v_ULTIMATE.start_main_~#t~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] {370757#true} is VALID [2022-02-20 20:13:06,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {370757#true} [339] L718-4-->thr1ENTRY: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_20| v_thr1Thread2of4ForFork0_thidvar0_2) (= v_thr1Thread2of4ForFork0_thidvar1_2 0) (= |v_thr1Thread2of4ForFork0_#in~arg.offset_4| 0) (= |v_thr1Thread2of4ForFork0_#in~arg.base_4| 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_20|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_20|, thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_8|, thr1Thread2of4ForFork0_~arg.base=v_thr1Thread2of4ForFork0_~arg.base_4, thr1Thread2of4ForFork0_~arg.offset=v_thr1Thread2of4ForFork0_~arg.offset_4, thr1Thread2of4ForFork0_#res.base=|v_thr1Thread2of4ForFork0_#res.base_4|, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_4|, thr1Thread2of4ForFork0_#res.offset=|v_thr1Thread2of4ForFork0_#res.offset_4|, thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_12, thr1Thread2of4ForFork0_thidvar1=v_thr1Thread2of4ForFork0_thidvar1_2, thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_4|, thr1Thread2of4ForFork0_thidvar0=v_thr1Thread2of4ForFork0_thidvar0_2} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#t~nondet4, thr1Thread2of4ForFork0_~arg.base, thr1Thread2of4ForFork0_~arg.offset, thr1Thread2of4ForFork0_#res.base, thr1Thread2of4ForFork0_#in~arg.base, thr1Thread2of4ForFork0_#res.offset, thr1Thread2of4ForFork0_~l~0, thr1Thread2of4ForFork0_thidvar1, thr1Thread2of4ForFork0_#in~arg.offset, thr1Thread2of4ForFork0_thidvar0] {370757#true} is VALID [2022-02-20 20:13:06,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {370757#true} [327] thr1ENTRY-->L704: Formula: (and (= |v_thr1Thread2of4ForFork0_#in~arg.base_1| v_thr1Thread2of4ForFork0_~arg.base_1) (= v_thr1Thread2of4ForFork0_~arg.offset_1 |v_thr1Thread2of4ForFork0_#in~arg.offset_1|)) InVars {thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_1|, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_1|} OutVars{thr1Thread2of4ForFork0_~arg.offset=v_thr1Thread2of4ForFork0_~arg.offset_1, thr1Thread2of4ForFork0_#in~arg.base=|v_thr1Thread2of4ForFork0_#in~arg.base_1|, thr1Thread2of4ForFork0_~arg.base=v_thr1Thread2of4ForFork0_~arg.base_1, thr1Thread2of4ForFork0_#in~arg.offset=|v_thr1Thread2of4ForFork0_#in~arg.offset_1|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~arg.base, thr1Thread2of4ForFork0_~arg.offset] {370757#true} is VALID [2022-02-20 20:13:06,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {370757#true} [328] L704-->L704-1: Formula: (and (<= 0 (+ |v_thr1Thread2of4ForFork0_#t~nondet4_1| 2147483648)) (<= |v_thr1Thread2of4ForFork0_#t~nondet4_1| 2147483647)) InVars {thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_1|} OutVars{thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {370757#true} is VALID [2022-02-20 20:13:06,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {370757#true} [329] L704-1-->L704-2: Formula: (= |v_thr1Thread2of4ForFork0_#t~nondet4_3| v_thr1Thread2of4ForFork0_~l~0_1) InVars {thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_3|} OutVars{thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_3|, thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_1} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~l~0] {370757#true} is VALID [2022-02-20 20:13:06,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {370757#true} [330] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread2of4ForFork0_#t~nondet4=|v_thr1Thread2of4ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_#t~nondet4] {370757#true} is VALID [2022-02-20 20:13:06,918 INFO L290 TraceCheckUtils]: 33: Hoare triple {370757#true} [331] L705-->L706: Formula: (= v_thr1Thread2of4ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread2of4ForFork0_~l~0] {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} is VALID [2022-02-20 20:13:06,918 INFO L290 TraceCheckUtils]: 34: Hoare triple {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} [317] thr1ENTRY-->L704: Formula: (and (= v_thr1Thread1of4ForFork0_~arg.base_1 |v_thr1Thread1of4ForFork0_#in~arg.base_1|) (= |v_thr1Thread1of4ForFork0_#in~arg.offset_1| v_thr1Thread1of4ForFork0_~arg.offset_1)) InVars {thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|} OutVars{thr1Thread1of4ForFork0_~arg.base=v_thr1Thread1of4ForFork0_~arg.base_1, thr1Thread1of4ForFork0_#in~arg.base=|v_thr1Thread1of4ForFork0_#in~arg.base_1|, thr1Thread1of4ForFork0_#in~arg.offset=|v_thr1Thread1of4ForFork0_#in~arg.offset_1|, thr1Thread1of4ForFork0_~arg.offset=v_thr1Thread1of4ForFork0_~arg.offset_1} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~arg.offset, thr1Thread1of4ForFork0_~arg.base] {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} is VALID [2022-02-20 20:13:06,919 INFO L290 TraceCheckUtils]: 35: Hoare triple {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} [318] L704-->L704-1: Formula: (and (<= |v_thr1Thread1of4ForFork0_#t~nondet4_1| 2147483647) (<= 0 (+ |v_thr1Thread1of4ForFork0_#t~nondet4_1| 2147483648))) InVars {thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_1|} OutVars{thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[] {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} is VALID [2022-02-20 20:13:06,919 INFO L290 TraceCheckUtils]: 36: Hoare triple {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} [319] L704-1-->L704-2: Formula: (= v_thr1Thread1of4ForFork0_~l~0_1 |v_thr1Thread1of4ForFork0_#t~nondet4_3|) InVars {thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_3|} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_1, thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_3|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~l~0] {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} is VALID [2022-02-20 20:13:06,919 INFO L290 TraceCheckUtils]: 37: Hoare triple {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} [320] L704-2-->L705: Formula: true InVars {} OutVars{thr1Thread1of4ForFork0_#t~nondet4=|v_thr1Thread1of4ForFork0_#t~nondet4_5|} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_#t~nondet4] {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} is VALID [2022-02-20 20:13:06,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {370759#(and (<= thr1Thread2of4ForFork0_~l~0 4) (<= 4 thr1Thread2of4ForFork0_~l~0))} [321] L705-->L706: Formula: (= v_thr1Thread1of4ForFork0_~l~0_3 4) InVars {} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_3} AuxVars[] AssignedVars[thr1Thread1of4ForFork0_~l~0] {370760#(and (<= thr1Thread2of4ForFork0_~l~0 thr1Thread1of4ForFork0_~l~0) (<= thr1Thread1of4ForFork0_~l~0 thr1Thread2of4ForFork0_~l~0))} is VALID [2022-02-20 20:13:06,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {370760#(and (<= thr1Thread2of4ForFork0_~l~0 thr1Thread1of4ForFork0_~l~0) (<= thr1Thread1of4ForFork0_~l~0 thr1Thread2of4ForFork0_~l~0))} [322] L706-->L708: Formula: (= v_thr1Thread1of4ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_5} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {370760#(and (<= thr1Thread2of4ForFork0_~l~0 thr1Thread1of4ForFork0_~l~0) (<= thr1Thread1of4ForFork0_~l~0 thr1Thread2of4ForFork0_~l~0))} is VALID [2022-02-20 20:13:06,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {370760#(and (<= thr1Thread2of4ForFork0_~l~0 thr1Thread1of4ForFork0_~l~0) (<= thr1Thread1of4ForFork0_~l~0 thr1Thread2of4ForFork0_~l~0))} [332] L706-->L708: Formula: (= v_thr1Thread2of4ForFork0_~l~0_5 v_~s~0_1) InVars {thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_5} OutVars{thr1Thread2of4ForFork0_~l~0=v_thr1Thread2of4ForFork0_~l~0_5, ~s~0=v_~s~0_1} AuxVars[] AssignedVars[~s~0] {370761#(and (<= thr1Thread1of4ForFork0_~l~0 ~s~0) (< ~s~0 (+ thr1Thread1of4ForFork0_~l~0 1)))} is VALID [2022-02-20 20:13:06,922 INFO L290 TraceCheckUtils]: 41: Hoare triple {370761#(and (<= thr1Thread1of4ForFork0_~l~0 ~s~0) (< ~s~0 (+ thr1Thread1of4ForFork0_~l~0 1)))} [323] L708-->thr1Err0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (not (= v_thr1Thread1of4ForFork0_~l~0_7 v_~s~0_6)) InVars {thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_7, ~s~0=v_~s~0_6} OutVars{thr1Thread1of4ForFork0_~l~0=v_thr1Thread1of4ForFork0_~l~0_7, ~s~0=v_~s~0_6} AuxVars[] AssignedVars[] {370758#false} is VALID [2022-02-20 20:13:06,923 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 20:13:06,923 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 20:13:06,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616678082] [2022-02-20 20:13:06,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616678082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 20:13:06,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 20:13:06,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 20:13:06,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960337201] [2022-02-20 20:13:06,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 20:13:06,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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 42 [2022-02-20 20:13:06,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 20:13:06,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 9.5) internal successors, (38), 5 states have internal predecessors, (38), 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:13:06,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 20:13:06,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 20:13:06,960 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 20:13:06,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 20:13:06,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 20:13:06,961 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 75 [2022-02-20 20:13:06,962 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 78 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 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:13:06,962 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-02-20 20:13:06,962 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 75 [2022-02-20 20:13:06,962 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-02-20 20:13:08,299 INFO L129 PetriNetUnfolder]: 3702/7116 cut-off events. [2022-02-20 20:13:08,300 INFO L130 PetriNetUnfolder]: For 5199/5199 co-relation queries the response was YES. [2022-02-20 20:13:08,320 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19072 conditions, 7116 events. 3702/7116 cut-off events. For 5199/5199 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 59481 event pairs, 603 based on Foata normal form. 42/6031 useless extension candidates. Maximal degree in co-relation 18991. Up to 1986 conditions per place. [2022-02-20 20:13:08,358 INFO L132 encePairwiseOnDemand]: 65/75 looper letters, 73 selfloop transitions, 29 changer transitions 0/148 dead transitions. [2022-02-20 20:13:08,358 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 148 transitions, 787 flow [2022-02-20 20:13:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 20:13:08,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-02-20 20:13:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2022-02-20 20:13:08,362 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8457142857142858 [2022-02-20 20:13:08,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 444 transitions. [2022-02-20 20:13:08,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 444 transitions. [2022-02-20 20:13:08,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-20 20:13:08,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 444 transitions. [2022-02-20 20:13:08,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 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:13:08,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 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:13:08,365 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 75.0) internal successors, (600), 8 states have internal predecessors, (600), 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:13:08,365 INFO L186 Difference]: Start difference. First operand has 83 places, 78 transitions, 252 flow. Second operand 7 states and 444 transitions. [2022-02-20 20:13:08,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 148 transitions, 787 flow