./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/fib_unsafe-5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/fib_unsafe-5.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 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 21:56:21,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 21:56:21,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 21:56:21,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 21:56:21,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 21:56:21,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 21:56:21,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 21:56:21,320 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 21:56:21,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 21:56:21,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 21:56:21,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 21:56:21,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 21:56:21,329 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 21:56:21,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 21:56:21,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 21:56:21,336 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 21:56:21,337 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 21:56:21,337 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 21:56:21,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 21:56:21,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 21:56:21,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 21:56:21,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 21:56:21,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 21:56:21,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 21:56:21,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 21:56:21,354 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 21:56:21,354 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 21:56:21,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 21:56:21,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 21:56:21,357 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 21:56:21,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 21:56:21,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 21:56:21,359 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 21:56:21,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 21:56:21,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 21:56:21,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 21:56:21,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 21:56:21,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 21:56:21,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 21:56:21,363 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 21:56:21,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 21:56:21,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 21:56:21,397 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 21:56:21,397 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 21:56:21,398 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 21:56:21,398 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 21:56:21,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 21:56:21,399 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 21:56:21,399 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 21:56:21,400 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 21:56:21,400 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 21:56:21,400 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 21:56:21,400 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 21:56:21,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 21:56:21,401 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 21:56:21,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 21:56:21,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 21:56:21,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 21:56:21,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 21:56:21,401 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 21:56:21,402 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 21:56:21,402 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 21:56:21,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 21:56:21,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 21:56:21,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 21:56:21,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 21:56:21,402 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:56:21,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 21:56:21,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 21:56:21,404 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 21:56:21,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 21:56:21,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 21:56:21,404 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 21:56:21,404 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 21:56:21,405 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 21:56:21,405 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 21:56:21,405 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 -> 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb [2021-12-17 21:56:21,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 21:56:21,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 21:56:21,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 21:56:21,664 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 21:56:21,665 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 21:56:21,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-5.i [2021-12-17 21:56:21,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68210e575/d540c9354f4946a2a4154537ad57dc78/FLAG3d059b48b [2021-12-17 21:56:22,128 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 21:56:22,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-5.i [2021-12-17 21:56:22,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68210e575/d540c9354f4946a2a4154537ad57dc78/FLAG3d059b48b [2021-12-17 21:56:22,158 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68210e575/d540c9354f4946a2a4154537ad57dc78 [2021-12-17 21:56:22,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 21:56:22,162 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 21:56:22,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 21:56:22,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 21:56:22,166 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 21:56:22,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,168 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e86034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22, skipping insertion in model container [2021-12-17 21:56:22,168 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 21:56:22,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 21:56:22,526 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/fib_unsafe-5.i[30819,30832] [2021-12-17 21:56:22,529 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:56:22,535 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 21:56:22,571 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/fib_unsafe-5.i[30819,30832] [2021-12-17 21:56:22,576 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 21:56:22,605 INFO L208 MainTranslator]: Completed translation [2021-12-17 21:56:22,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22 WrapperNode [2021-12-17 21:56:22,605 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 21:56:22,606 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 21:56:22,606 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 21:56:22,606 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 21:56:22,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,649 INFO L137 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2021-12-17 21:56:22,649 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 21:56:22,650 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 21:56:22,650 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 21:56:22,650 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 21:56:22,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,661 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,665 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,669 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,670 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 21:56:22,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 21:56:22,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 21:56:22,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 21:56:22,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (1/1) ... [2021-12-17 21:56:22,693 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 21:56:22,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:56:22,709 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) [2021-12-17 21:56:22,731 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 [2021-12-17 21:56:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-12-17 21:56:22,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-12-17 21:56:22,742 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-12-17 21:56:22,742 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-12-17 21:56:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-17 21:56:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 21:56:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 21:56:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 21:56:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 21:56:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 21:56:22,743 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 21:56:22,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 21:56:22,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 21:56:22,745 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 21:56:22,845 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 21:56:22,856 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 21:56:23,032 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 21:56:23,037 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 21:56:23,037 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-17 21:56:23,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:56:23 BoogieIcfgContainer [2021-12-17 21:56:23,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 21:56:23,040 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 21:56:23,040 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 21:56:23,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 21:56:23,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 09:56:22" (1/3) ... [2021-12-17 21:56:23,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c213033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:56:23, skipping insertion in model container [2021-12-17 21:56:23,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 09:56:22" (2/3) ... [2021-12-17 21:56:23,056 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c213033 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 09:56:23, skipping insertion in model container [2021-12-17 21:56:23,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 09:56:23" (3/3) ... [2021-12-17 21:56:23,057 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2021-12-17 21:56:23,061 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 21:56:23,061 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 21:56:23,061 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 21:56:23,062 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 21:56:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,088 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,088 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,088 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,089 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,089 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,089 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,090 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,091 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,091 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,092 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,092 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,092 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,092 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,092 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,093 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,094 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,097 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,097 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,097 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,102 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,102 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,103 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 21:56:23,104 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-17 21:56:23,151 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 21:56:23,157 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 [2021-12-17 21:56:23,157 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-17 21:56:23,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions, 202 flow [2021-12-17 21:56:23,208 INFO L129 PetriNetUnfolder]: 7/94 cut-off events. [2021-12-17 21:56:23,209 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 21:56:23,212 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 7/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2021-12-17 21:56:23,213 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 96 transitions, 202 flow [2021-12-17 21:56:23,217 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 94 transitions, 194 flow [2021-12-17 21:56:23,243 INFO L129 PetriNetUnfolder]: 7/85 cut-off events. [2021-12-17 21:56:23,243 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 21:56:23,244 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 21:56:23,244 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:56:23,245 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 21:56:23,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:56:23,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1927097680, now seen corresponding path program 1 times [2021-12-17 21:56:23,258 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:56:23,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891263859] [2021-12-17 21:56:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:56:23,260 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:56:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:56:23,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:23,455 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:56:23,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891263859] [2021-12-17 21:56:23,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891263859] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:56:23,456 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:56:23,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 21:56:23,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336535004] [2021-12-17 21:56:23,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:56:23,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 21:56:23,466 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:56:23,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 21:56:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 21:56:23,494 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 96 [2021-12-17 21:56:23,499 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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) [2021-12-17 21:56:23,501 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 21:56:23,501 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 96 [2021-12-17 21:56:23,502 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 21:56:23,537 INFO L129 PetriNetUnfolder]: 3/89 cut-off events. [2021-12-17 21:56:23,537 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-17 21:56:23,539 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 3/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 5/90 useless extension candidates. Maximal degree in co-relation 60. Up to 3 conditions per place. [2021-12-17 21:56:23,540 INFO L132 encePairwiseOnDemand]: 92/96 looper letters, 2 selfloop transitions, 0 changer transitions 0/89 dead transitions. [2021-12-17 21:56:23,540 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 188 flow [2021-12-17 21:56:23,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 21:56:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 21:56:23,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2021-12-17 21:56:23,554 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2021-12-17 21:56:23,555 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 184 transitions. [2021-12-17 21:56:23,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 184 transitions. [2021-12-17 21:56:23,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 21:56:23,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 184 transitions. [2021-12-17 21:56:23,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 92.0) internal successors, (184), 2 states have internal predecessors, (184), 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) [2021-12-17 21:56:23,568 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 21:56:23,569 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 21:56:23,570 INFO L186 Difference]: Start difference. First operand has 94 places, 94 transitions, 194 flow. Second operand 2 states and 184 transitions. [2021-12-17 21:56:23,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 188 flow [2021-12-17 21:56:23,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 89 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 21:56:23,580 INFO L242 Difference]: Finished difference. Result has 92 places, 89 transitions, 182 flow [2021-12-17 21:56:23,582 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2021-12-17 21:56:23,586 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2021-12-17 21:56:23,587 INFO L470 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 182 flow [2021-12-17 21:56:23,587 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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) [2021-12-17 21:56:23,587 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 21:56:23,588 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:56:23,588 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 21:56:23,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 21:56:23,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:56:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 560415153, now seen corresponding path program 1 times [2021-12-17 21:56:23,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:56:23,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854320584] [2021-12-17 21:56:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:56:23,590 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:56:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:56:23,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:23,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:56:23,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854320584] [2021-12-17 21:56:23,683 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854320584] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 21:56:23,683 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 21:56:23,683 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 21:56:23,683 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788426592] [2021-12-17 21:56:23,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 21:56:23,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 21:56:23,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:56:23,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 21:56:23,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 21:56:23,686 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2021-12-17 21:56:23,686 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2021-12-17 21:56:23,686 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 21:56:23,686 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2021-12-17 21:56:23,686 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 21:56:23,722 INFO L129 PetriNetUnfolder]: 3/95 cut-off events. [2021-12-17 21:56:23,723 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 21:56:23,724 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 110. Up to 6 conditions per place. [2021-12-17 21:56:23,726 INFO L132 encePairwiseOnDemand]: 93/96 looper letters, 9 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2021-12-17 21:56:23,726 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 210 flow [2021-12-17 21:56:23,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 21:56:23,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-17 21:56:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2021-12-17 21:56:23,731 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.90625 [2021-12-17 21:56:23,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 261 transitions. [2021-12-17 21:56:23,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions. [2021-12-17 21:56:23,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 21:56:23,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions. [2021-12-17 21:56:23,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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) [2021-12-17 21:56:23,735 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2021-12-17 21:56:23,735 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2021-12-17 21:56:23,735 INFO L186 Difference]: Start difference. First operand has 92 places, 89 transitions, 182 flow. Second operand 3 states and 261 transitions. [2021-12-17 21:56:23,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 210 flow [2021-12-17 21:56:23,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 21:56:23,745 INFO L242 Difference]: Finished difference. Result has 95 places, 90 transitions, 194 flow [2021-12-17 21:56:23,746 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2021-12-17 21:56:23,746 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2021-12-17 21:56:23,746 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 194 flow [2021-12-17 21:56:23,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2021-12-17 21:56:23,747 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 21:56:23,747 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:56:23,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-17 21:56:23,747 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 21:56:23,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:56:23,748 INFO L85 PathProgramCache]: Analyzing trace with hash -951035470, now seen corresponding path program 1 times [2021-12-17 21:56:23,748 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:56:23,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446188921] [2021-12-17 21:56:23,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:56:23,748 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:56:23,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:56:23,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:23,832 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:56:23,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446188921] [2021-12-17 21:56:23,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446188921] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:56:23,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584340458] [2021-12-17 21:56:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:56:23,833 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:56:23,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:56:23,835 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:56:23,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 21:56:23,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:56:23,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 21:56:23,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:56:24,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:24,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 21:56:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:24,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584340458] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 21:56:24,200 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 21:56:24,200 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2021-12-17 21:56:24,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086878609] [2021-12-17 21:56:24,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 21:56:24,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 21:56:24,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:56:24,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 21:56:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-12-17 21:56:24,205 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2021-12-17 21:56:24,206 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 194 flow. Second operand has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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) [2021-12-17 21:56:24,206 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 21:56:24,206 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2021-12-17 21:56:24,206 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 21:56:24,306 INFO L129 PetriNetUnfolder]: 3/104 cut-off events. [2021-12-17 21:56:24,307 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 21:56:24,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 104 events. 3/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 133. Up to 6 conditions per place. [2021-12-17 21:56:24,309 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 10 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2021-12-17 21:56:24,309 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 250 flow [2021-12-17 21:56:24,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 21:56:24,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 21:56:24,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 750 transitions. [2021-12-17 21:56:24,315 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2021-12-17 21:56:24,315 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 750 transitions. [2021-12-17 21:56:24,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 750 transitions. [2021-12-17 21:56:24,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 21:56:24,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 750 transitions. [2021-12-17 21:56:24,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 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) [2021-12-17 21:56:24,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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) [2021-12-17 21:56:24,320 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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) [2021-12-17 21:56:24,321 INFO L186 Difference]: Start difference. First operand has 95 places, 90 transitions, 194 flow. Second operand 9 states and 750 transitions. [2021-12-17 21:56:24,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 250 flow [2021-12-17 21:56:24,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-17 21:56:24,327 INFO L242 Difference]: Finished difference. Result has 105 places, 96 transitions, 242 flow [2021-12-17 21:56:24,328 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=105, PETRI_TRANSITIONS=96} [2021-12-17 21:56:24,330 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2021-12-17 21:56:24,330 INFO L470 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 242 flow [2021-12-17 21:56:24,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 83.0) internal successors, (830), 10 states have internal predecessors, (830), 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) [2021-12-17 21:56:24,331 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 21:56:24,331 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:56:24,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 21:56:24,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:56:24,551 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 21:56:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:56:24,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1666707666, now seen corresponding path program 2 times [2021-12-17 21:56:24,552 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:56:24,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179221069] [2021-12-17 21:56:24,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:56:24,552 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:56:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:56:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:24,648 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:56:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179221069] [2021-12-17 21:56:24,649 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179221069] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:56:24,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540628321] [2021-12-17 21:56:24,649 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 21:56:24,649 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:56:24,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:56:24,650 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:56:24,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 21:56:24,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 21:56:24,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 21:56:24,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 21:56:24,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:56:24,842 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:24,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 21:56:24,974 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:24,974 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540628321] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 21:56:24,974 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 21:56:24,974 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2021-12-17 21:56:24,975 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350441676] [2021-12-17 21:56:24,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 21:56:24,975 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-17 21:56:24,976 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:56:24,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-17 21:56:24,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-12-17 21:56:24,978 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2021-12-17 21:56:24,980 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 242 flow. Second operand has 18 states, 18 states have (on average 83.0) internal successors, (1494), 18 states have internal predecessors, (1494), 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) [2021-12-17 21:56:24,980 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 21:56:24,980 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2021-12-17 21:56:24,980 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 21:56:25,174 INFO L129 PetriNetUnfolder]: 3/132 cut-off events. [2021-12-17 21:56:25,175 INFO L130 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2021-12-17 21:56:25,175 INFO L84 FinitePrefix]: Finished finitePrefix Result has 231 conditions, 132 events. 3/132 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 4/133 useless extension candidates. Maximal degree in co-relation 224. Up to 11 conditions per place. [2021-12-17 21:56:25,176 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 14 selfloop transitions, 21 changer transitions 0/114 dead transitions. [2021-12-17 21:56:25,176 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 114 transitions, 408 flow [2021-12-17 21:56:25,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 21:56:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-12-17 21:56:25,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1740 transitions. [2021-12-17 21:56:25,180 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2021-12-17 21:56:25,181 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1740 transitions. [2021-12-17 21:56:25,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1740 transitions. [2021-12-17 21:56:25,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 21:56:25,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1740 transitions. [2021-12-17 21:56:25,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 82.85714285714286) internal successors, (1740), 21 states have internal predecessors, (1740), 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) [2021-12-17 21:56:25,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 96.0) internal successors, (2112), 22 states have internal predecessors, (2112), 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) [2021-12-17 21:56:25,189 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 96.0) internal successors, (2112), 22 states have internal predecessors, (2112), 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) [2021-12-17 21:56:25,189 INFO L186 Difference]: Start difference. First operand has 105 places, 96 transitions, 242 flow. Second operand 21 states and 1740 transitions. [2021-12-17 21:56:25,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 114 transitions, 408 flow [2021-12-17 21:56:25,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 114 transitions, 394 flow, removed 6 selfloop flow, removed 1 redundant places. [2021-12-17 21:56:25,194 INFO L242 Difference]: Finished difference. Result has 129 places, 109 transitions, 366 flow [2021-12-17 21:56:25,194 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=366, PETRI_PLACES=129, PETRI_TRANSITIONS=109} [2021-12-17 21:56:25,196 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 35 predicate places. [2021-12-17 21:56:25,196 INFO L470 AbstractCegarLoop]: Abstraction has has 129 places, 109 transitions, 366 flow [2021-12-17 21:56:25,197 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 83.0) internal successors, (1494), 18 states have internal predecessors, (1494), 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) [2021-12-17 21:56:25,197 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 21:56:25,197 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:56:25,223 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 21:56:25,415 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-17 21:56:25,415 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 21:56:25,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:56:25,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1283180782, now seen corresponding path program 3 times [2021-12-17 21:56:25,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:56:25,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133395316] [2021-12-17 21:56:25,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:56:25,416 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:56:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:56:25,618 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:25,619 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:56:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133395316] [2021-12-17 21:56:25,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133395316] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:56:25,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281205740] [2021-12-17 21:56:25,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 21:56:25,619 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:56:25,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:56:25,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:56:25,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 21:56:25,700 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-12-17 21:56:25,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 21:56:25,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 21:56:25,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:56:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:25,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 21:56:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:26,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281205740] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 21:56:26,159 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 21:56:26,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2021-12-17 21:56:26,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596800777] [2021-12-17 21:56:26,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 21:56:26,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2021-12-17 21:56:26,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 21:56:26,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2021-12-17 21:56:26,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2021-12-17 21:56:26,162 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2021-12-17 21:56:26,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 109 transitions, 366 flow. Second operand has 27 states, 27 states have (on average 83.07407407407408) internal successors, (2243), 27 states have internal predecessors, (2243), 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) [2021-12-17 21:56:26,163 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 21:56:26,163 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2021-12-17 21:56:26,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 21:56:26,518 INFO L129 PetriNetUnfolder]: 3/167 cut-off events. [2021-12-17 21:56:26,519 INFO L130 PetriNetUnfolder]: For 184/184 co-relation queries the response was YES. [2021-12-17 21:56:26,520 INFO L84 FinitePrefix]: Finished finitePrefix Result has 381 conditions, 167 events. 3/167 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 5/169 useless extension candidates. Maximal degree in co-relation 369. Up to 21 conditions per place. [2021-12-17 21:56:26,521 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 19 selfloop transitions, 36 changer transitions 0/134 dead transitions. [2021-12-17 21:56:26,521 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 134 transitions, 668 flow [2021-12-17 21:56:26,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-17 21:56:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-12-17 21:56:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2976 transitions. [2021-12-17 21:56:26,527 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2021-12-17 21:56:26,528 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2976 transitions. [2021-12-17 21:56:26,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2976 transitions. [2021-12-17 21:56:26,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 21:56:26,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2976 transitions. [2021-12-17 21:56:26,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 82.66666666666667) internal successors, (2976), 36 states have internal predecessors, (2976), 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) [2021-12-17 21:56:26,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 96.0) internal successors, (3552), 37 states have internal predecessors, (3552), 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) [2021-12-17 21:56:26,542 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 96.0) internal successors, (3552), 37 states have internal predecessors, (3552), 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) [2021-12-17 21:56:26,542 INFO L186 Difference]: Start difference. First operand has 129 places, 109 transitions, 366 flow. Second operand 36 states and 2976 transitions. [2021-12-17 21:56:26,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 134 transitions, 668 flow [2021-12-17 21:56:26,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 134 transitions, 634 flow, removed 11 selfloop flow, removed 6 redundant places. [2021-12-17 21:56:26,548 INFO L242 Difference]: Finished difference. Result has 164 places, 125 transitions, 554 flow [2021-12-17 21:56:26,549 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=554, PETRI_PLACES=164, PETRI_TRANSITIONS=125} [2021-12-17 21:56:26,549 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 70 predicate places. [2021-12-17 21:56:26,549 INFO L470 AbstractCegarLoop]: Abstraction has has 164 places, 125 transitions, 554 flow [2021-12-17 21:56:26,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 83.07407407407408) internal successors, (2243), 27 states have internal predecessors, (2243), 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) [2021-12-17 21:56:26,551 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 21:56:26,551 INFO L254 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 21:56:26,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 21:56:26,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:56:26,767 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 21:56:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 21:56:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1938020081, now seen corresponding path program 4 times [2021-12-17 21:56:26,768 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 21:56:26,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351952491] [2021-12-17 21:56:26,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 21:56:26,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 21:56:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 21:56:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:27,807 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 21:56:27,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351952491] [2021-12-17 21:56:27,807 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351952491] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 21:56:27,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907036563] [2021-12-17 21:56:27,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 21:56:27,807 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 21:56:27,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 21:56:27,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 21:56:27,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 21:56:27,879 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 21:56:27,879 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 21:56:27,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 41 conjunts are in the unsatisfiable core [2021-12-17 21:56:27,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 21:56:30,529 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 335 proven. 139 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 21:56:30,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:01:57,764 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 472 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:01:57,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907036563] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:01:57,765 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 22:01:57,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 121 [2021-12-17 22:01:57,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970882883] [2021-12-17 22:01:57,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 22:01:57,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2021-12-17 22:01:57,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 22:01:57,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2021-12-17 22:01:57,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=13515, Unknown=59, NotChecked=0, Total=14520 [2021-12-17 22:01:57,774 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 96 [2021-12-17 22:01:57,780 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 125 transitions, 554 flow. Second operand has 121 states, 121 states have (on average 69.27272727272727) internal successors, (8382), 121 states have internal predecessors, (8382), 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) [2021-12-17 22:01:57,780 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:01:57,780 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 96 [2021-12-17 22:01:57,780 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:02:00,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_~j~0 (- 1))) (.cse2 (+ c_~cur~0 c_~prev~0 1)) (.cse11 (* c_~i~0 (- 1))) (.cse4 (+ (* 2 c_~cur~0) c_~prev~0 3))) (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse0 (* 2 c_~cur~0))) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_div_v_~cur~0_22_51 (+ .cse0 c_~prev~0 1)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) .cse0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24)))))) (<= (div (+ c_~cur~0 .cse1 (- 3)) (- 2)) .cse2) (forall ((v_~cur~0_22 Int)) (or (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22))))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22))) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22))))) (< v_~cur~0_22 (+ c_~cur~0 c_~prev~0)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse3 (* 2 c_~cur~0))) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_div_v_~cur~0_22_51 (+ .cse3 c_~prev~0 1)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) .cse3 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24))) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0))))) (<= (div (+ c_~cur~0 .cse1 c_~prev~0 (- 7)) (- 2)) .cse4) (forall ((v_~j~0_8 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse5 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) v_~j~0_8 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse5)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 v_~j~0_8) (* 2 aux_mod_v_~next~0_20_56) 23)) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse5 1)) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse6 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse6)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse6 1)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26)))))) (< 1 v_~j~0_8))) (= c_~prev~0 0) (forall ((v_~prev~0_24 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24))) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 1)) (<= 2 aux_mod_v_~cur~0_22_51))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24))) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 1)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23))))) (< v_~prev~0_24 c_~cur~0))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse7 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse7)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse7 1)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse8 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse8 1)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse8)) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26))))) (= c_~cur~0 1) (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse9 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse9)) (< aux_mod_v_~next~0_20_56 0) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 .cse9 1)) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 v_~cur~0_26)) (<= 2 aux_mod_v_~cur~0_22_51)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse10 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse10)) (< aux_mod_v_~next~0_20_56 0) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 .cse10 1)) (<= 2 aux_mod_v_~next~0_20_56) (< v_~prev~0_24 (+ c_~cur~0 v_~cur~0_26)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)))))) (< v_~cur~0_26 (+ c_~cur~0 c_~prev~0)))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22) c_~prev~0)) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 c_~cur~0) (* 2 aux_div_v_~next~0_20_56) c_~prev~0)))) (<= (div (+ c_~cur~0 .cse11 (- 3)) (- 2)) .cse2) (<= (div (+ c_~cur~0 .cse11 c_~prev~0 (- 7)) (- 2)) .cse4) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 c_~cur~0) (* 2 aux_div_v_~next~0_20_56) c_~prev~0)) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22)))))) is different from false [2021-12-17 22:04:28,847 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~i~0 (- 1))) (.cse16 (* c_~j~0 (- 1)))) (let ((.cse0 (div (+ c_~cur~0 .cse16 (- 3)) (- 2))) (.cse3 (+ c_~cur~0 c_~prev~0 1)) (.cse6 (div (+ c_~next~0 .cse16 (- 5)) (- 2))) (.cse5 (+ c_~next~0 c_~prev~0 2)) (.cse12 (+ (* 2 c_~next~0) c_~cur~0 4)) (.cse11 (+ (* 2 c_~cur~0) c_~prev~0 3)) (.cse9 (div (+ c_~cur~0 .cse10 (- 3)) (- 2))) (.cse1 (+ c_~next~0 1)) (.cse4 (div (+ c_~next~0 .cse10 (- 5)) (- 2))) (.cse7 (+ c_~next~0 c_~cur~0 2))) (and (<= .cse0 .cse1) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse2 (* 2 c_~cur~0))) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_div_v_~cur~0_22_51 (+ .cse2 c_~prev~0 1)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) .cse2 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24)))))) (<= .cse0 .cse3) (forall ((v_~cur~0_22 Int)) (or (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22))))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22))) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22))))) (< v_~cur~0_22 (+ c_~cur~0 c_~prev~0)))) (forall ((v_~prev~0_24 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= 2 aux_mod_v_~cur~0_22_51) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24))) (< aux_div_v_~cur~0_22_51 (+ c_~next~0 1)) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24))) (<= 2 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ c_~next~0 1))))) (< v_~prev~0_24 c_~cur~0))) (<= .cse4 .cse5) (<= .cse6 .cse7) (= c_~prev~0 0) (forall ((v_~prev~0_24 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24))) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 1)) (<= 2 aux_mod_v_~cur~0_22_51))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24))) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 1)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23))))) (< v_~prev~0_24 c_~cur~0))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse8 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse8)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse8 1)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26))))) (forall ((v_~cur~0_22 Int)) (or (and (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22))))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22))) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22))))) (< v_~cur~0_22 c_~next~0))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22) c_~prev~0)) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)))) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 2 v_~cur~0_22) c_~prev~0)) (< v_~cur~0_22 (+ (* 2 c_~cur~0) c_~prev~0)))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 c_~cur~0) (* 2 aux_div_v_~next~0_20_56) c_~prev~0)))) (<= .cse9 .cse3) (<= .cse6 .cse5) (<= (div (+ c_~cur~0 .cse10 c_~prev~0 (- 7)) (- 2)) .cse11) (<= (div (+ c_~next~0 c_~cur~0 .cse10 (- 9)) (- 2)) .cse12) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< v_~cur~0_22 (+ c_~next~0 c_~cur~0)) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) (* 2 v_~cur~0_22))) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_div_v_~cur~0_22_51 (+ c_~next~0 c_~cur~0 1)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 c_~next~0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24))) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)))) (forall ((aux_div_v_~next~0_20_56 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~next~0_20_56 0) (< (+ c_~i~0 aux_mod_v_~next~0_20_56 9) (+ (* 2 c_~cur~0) (* 2 aux_div_v_~next~0_20_56) c_~prev~0)) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) c_~cur~0) (+ (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 22)))) (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse13 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse13)) (< aux_mod_v_~next~0_20_56 0) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 .cse13 1)) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 v_~cur~0_26)) (<= 2 aux_mod_v_~cur~0_22_51)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse14 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse14)) (< aux_mod_v_~next~0_20_56 0) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 .cse14 1)) (<= 2 aux_mod_v_~next~0_20_56) (< v_~prev~0_24 (+ c_~cur~0 v_~cur~0_26)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)))))) (< v_~cur~0_26 c_~next~0))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse15 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse15)) (< aux_mod_v_~next~0_20_56 0) (< v_~prev~0_24 (+ c_~next~0 v_~cur~0_26)) (<= 2 aux_mod_v_~next~0_20_56) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< aux_div_v_~cur~0_22_51 (+ c_~next~0 .cse15 1)) (< v_~cur~0_26 (+ c_~next~0 c_~cur~0))))) (<= (div (+ c_~next~0 c_~cur~0 .cse16 (- 9)) (- 2)) .cse12) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse17 (* 2 c_~cur~0))) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_div_v_~cur~0_22_51 (+ .cse17 c_~prev~0 1)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) .cse17 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24))) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0))))) (<= (div (+ c_~cur~0 .cse16 c_~prev~0 (- 7)) (- 2)) .cse11) (forall ((aux_div_v_~next~0_20_56 Int) (v_~cur~0_22 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< (+ c_~j~0 aux_mod_v_~next~0_20_56 9) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) (* 2 v_~cur~0_22))) (<= (+ (* 5 aux_div_v_~next~0_20_56) v_~cur~0_22) (+ (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 22)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< v_~cur~0_22 (+ c_~next~0 c_~cur~0)))) (<= .cse9 .cse1) (forall ((v_~j~0_8 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse18 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) v_~j~0_8 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse18)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 v_~j~0_8) (* 2 aux_mod_v_~next~0_20_56) 23)) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse18 1)) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26))))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse19 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse19)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse19 1)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26)))))) (< 1 v_~j~0_8))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_div_v_~cur~0_22_51 (+ c_~next~0 c_~cur~0 1)) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 c_~next~0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24))))) (= c_~cur~0 1) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse20 (* 2 v_~cur~0_26))) (or (< v_~cur~0_26 (+ (* 2 c_~cur~0) c_~prev~0)) (< aux_mod_v_~cur~0_22_51 0) (< aux_mod_v_~next~0_20_56 0) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 c_~prev~0 .cse20 1)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) c_~prev~0 (* 3 v_~prev~0_24) .cse20)) (<= 2 aux_mod_v_~cur~0_22_51) (< v_~prev~0_24 (+ c_~cur~0 c_~prev~0 v_~cur~0_26))))) (forall ((v_~cur~0_26 Int)) (or (and (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse21 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse21)) (< aux_mod_v_~next~0_20_56 0) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 .cse21 1)) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (< v_~prev~0_24 (+ c_~cur~0 v_~cur~0_26)) (<= 2 aux_mod_v_~cur~0_22_51)))) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse22 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~i~0 aux_mod_v_~next~0_20_56 11) (+ (* 2 aux_div_v_~next~0_20_56) c_~cur~0 (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse22)) (< aux_mod_v_~next~0_20_56 0) (< aux_div_v_~cur~0_22_51 (+ c_~cur~0 .cse22 1)) (<= 2 aux_mod_v_~next~0_20_56) (< v_~prev~0_24 (+ c_~cur~0 v_~cur~0_26)) (<= 2 aux_mod_v_~cur~0_22_51) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~i~0) (* 2 aux_mod_v_~next~0_20_56) 23)))))) (< v_~cur~0_26 (+ c_~cur~0 c_~prev~0)))) (<= .cse4 .cse7) (forall ((aux_mod_v_~cur~0_22_51 Int) (aux_div_v_~next~0_20_56 Int) (aux_div_v_~cur~0_22_51 Int) (v_~prev~0_24 Int) (v_~cur~0_26 Int) (aux_mod_v_~next~0_20_56 Int)) (let ((.cse23 (* 2 v_~cur~0_26))) (or (< aux_mod_v_~cur~0_22_51 0) (< aux_mod_v_~next~0_20_56 0) (< v_~prev~0_24 (+ c_~next~0 v_~cur~0_26)) (< (+ (* 2 aux_mod_v_~cur~0_22_51) c_~j~0 aux_mod_v_~next~0_20_56 11) (+ c_~next~0 (* 2 aux_div_v_~next~0_20_56) (* 4 aux_div_v_~cur~0_22_51) (* 3 v_~prev~0_24) .cse23)) (<= 2 aux_mod_v_~next~0_20_56) (<= (+ (* 5 aux_div_v_~next~0_20_56) (* 2 aux_div_v_~cur~0_22_51) v_~prev~0_24) (+ aux_mod_v_~cur~0_22_51 (* 2 c_~j~0) (* 2 aux_mod_v_~next~0_20_56) 23)) (<= 2 aux_mod_v_~cur~0_22_51) (< aux_div_v_~cur~0_22_51 (+ c_~next~0 .cse23 1)) (< v_~cur~0_26 (+ c_~next~0 c_~cur~0)))))))) is different from false [2021-12-17 22:04:40,798 WARN L228 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-12-17 22:04:40,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 22:04:40,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2021-12-17 22:04:40,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 22:04:41,000 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 22:04:41,000 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:260) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:483) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:452) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:433) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:171) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:197) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:212) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:137) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfoldingHelper(PetriNetUnfolder.java:208) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.computeUnfolding(PetriNetUnfolder.java:167) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:128) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:65) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:120) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:509) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:280) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:462) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:226) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:237) ... 53 more [2021-12-17 22:04:41,004 INFO L158 Benchmark]: Toolchain (without parser) took 498841.74ms. Allocated memory was 81.8MB in the beginning and 157.3MB in the end (delta: 75.5MB). Free memory was 44.8MB in the beginning and 89.9MB in the end (delta: -45.1MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2021-12-17 22:04:41,004 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:04:41,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 442.30ms. Allocated memory is still 81.8MB. Free memory was 44.6MB in the beginning and 48.8MB in the end (delta: -4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 22:04:41,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.26ms. Allocated memory is still 81.8MB. Free memory was 48.8MB in the beginning and 46.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 22:04:41,005 INFO L158 Benchmark]: Boogie Preprocessor took 20.75ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 45.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 22:04:41,005 INFO L158 Benchmark]: RCFGBuilder took 367.78ms. Allocated memory is still 81.8MB. Free memory was 45.2MB in the beginning and 33.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-17 22:04:41,005 INFO L158 Benchmark]: TraceAbstraction took 497962.82ms. Allocated memory was 81.8MB in the beginning and 157.3MB in the end (delta: 75.5MB). Free memory was 32.7MB in the beginning and 89.9MB in the end (delta: -57.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2021-12-17 22:04:41,009 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 81.8MB. Free memory is still 62.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 442.30ms. Allocated memory is still 81.8MB. Free memory was 44.6MB in the beginning and 48.8MB in the end (delta: -4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.26ms. Allocated memory is still 81.8MB. Free memory was 48.8MB in the beginning and 46.8MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.75ms. Allocated memory is still 81.8MB. Free memory was 46.8MB in the beginning and 45.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 367.78ms. Allocated memory is still 81.8MB. Free memory was 45.2MB in the beginning and 33.3MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 497962.82ms. Allocated memory was 81.8MB in the beginning and 157.3MB in the end (delta: 75.5MB). Free memory was 32.7MB in the beginning and 89.9MB in the end (delta: -57.2MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:241) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/fib_unsafe-5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 22:04:42,329 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 22:04:42,330 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 22:04:42,357 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 22:04:42,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 22:04:42,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 22:04:42,364 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 22:04:42,366 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 22:04:42,368 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 22:04:42,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 22:04:42,369 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 22:04:42,370 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 22:04:42,370 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 22:04:42,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 22:04:42,371 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 22:04:42,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 22:04:42,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 22:04:42,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 22:04:42,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 22:04:42,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 22:04:42,376 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 22:04:42,377 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 22:04:42,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 22:04:42,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 22:04:42,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 22:04:42,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 22:04:42,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 22:04:42,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 22:04:42,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 22:04:42,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 22:04:42,382 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 22:04:42,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 22:04:42,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 22:04:42,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 22:04:42,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 22:04:42,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 22:04:42,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 22:04:42,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 22:04:42,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 22:04:42,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 22:04:42,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 22:04:42,387 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 22:04:42,409 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 22:04:42,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 22:04:42,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 22:04:42,412 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 22:04:42,412 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 22:04:42,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 22:04:42,413 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 22:04:42,413 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 22:04:42,414 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 22:04:42,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 22:04:42,414 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 22:04:42,415 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 22:04:42,416 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 22:04:42,416 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 22:04:42,416 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 22:04:42,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 22:04:42,423 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 22:04:42,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 22:04:42,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 22:04:42,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:04:42,424 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 22:04:42,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 22:04:42,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 22:04:42,424 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 22:04:42,424 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 22:04:42,424 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 22:04:42,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 22:04:42,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 22:04:42,425 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 22:04:42,425 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 22:04:42,425 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 146f0d3d7f309689872842ec2e107172ef6d7d230f0dea419a95cb8899767aeb [2021-12-17 22:04:42,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 22:04:42,692 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 22:04:42,694 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 22:04:42,695 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 22:04:42,695 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 22:04:42,696 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/fib_unsafe-5.i [2021-12-17 22:04:42,742 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802f2b6e/cf10fa15265d44289194e3709ecdd157/FLAGe844c607e [2021-12-17 22:04:43,173 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 22:04:43,173 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/fib_unsafe-5.i [2021-12-17 22:04:43,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802f2b6e/cf10fa15265d44289194e3709ecdd157/FLAGe844c607e [2021-12-17 22:04:43,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0802f2b6e/cf10fa15265d44289194e3709ecdd157 [2021-12-17 22:04:43,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 22:04:43,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 22:04:43,540 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 22:04:43,540 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 22:04:43,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 22:04:43,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:04:43" (1/1) ... [2021-12-17 22:04:43,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114eaec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:43, skipping insertion in model container [2021-12-17 22:04:43,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 10:04:43" (1/1) ... [2021-12-17 22:04:43,552 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 22:04:43,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 22:04:43,929 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/fib_unsafe-5.i[30819,30832] [2021-12-17 22:04:43,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:04:43,945 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 22:04:44,001 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/fib_unsafe-5.i[30819,30832] [2021-12-17 22:04:44,001 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 22:04:44,047 INFO L208 MainTranslator]: Completed translation [2021-12-17 22:04:44,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44 WrapperNode [2021-12-17 22:04:44,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 22:04:44,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 22:04:44,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 22:04:44,052 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 22:04:44,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,118 INFO L137 Inliner]: procedures = 167, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 71 [2021-12-17 22:04:44,118 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 22:04:44,120 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 22:04:44,120 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 22:04:44,120 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 22:04:44,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,131 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,132 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 22:04:44,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 22:04:44,174 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 22:04:44,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 22:04:44,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (1/1) ... [2021-12-17 22:04:44,182 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 22:04:44,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 22:04:44,233 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) [2021-12-17 22:04:44,275 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 [2021-12-17 22:04:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2021-12-17 22:04:44,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2021-12-17 22:04:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2021-12-17 22:04:44,296 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2021-12-17 22:04:44,296 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-17 22:04:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 22:04:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-17 22:04:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-17 22:04:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-17 22:04:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 22:04:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-17 22:04:44,297 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 22:04:44,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 22:04:44,299 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-17 22:04:44,419 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 22:04:44,421 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 22:04:44,602 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 22:04:44,608 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 22:04:44,609 INFO L301 CfgBuilder]: Removed 3 assume(true) statements. [2021-12-17 22:04:44,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:04:44 BoogieIcfgContainer [2021-12-17 22:04:44,611 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 22:04:44,613 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 22:04:44,613 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 22:04:44,615 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 22:04:44,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 10:04:43" (1/3) ... [2021-12-17 22:04:44,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6183fd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:04:44, skipping insertion in model container [2021-12-17 22:04:44,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 10:04:44" (2/3) ... [2021-12-17 22:04:44,617 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6183fd64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 10:04:44, skipping insertion in model container [2021-12-17 22:04:44,617 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 10:04:44" (3/3) ... [2021-12-17 22:04:44,618 INFO L111 eAbstractionObserver]: Analyzing ICFG fib_unsafe-5.i [2021-12-17 22:04:44,623 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-17 22:04:44,623 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 22:04:44,624 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 22:04:44,624 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-17 22:04:44,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,661 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,662 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,662 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,662 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,662 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,662 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,663 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,663 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,664 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,665 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,665 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,665 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,666 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,666 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,666 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,666 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,666 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,667 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,667 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,667 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,667 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,668 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,668 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,668 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,668 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,669 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,672 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,673 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,673 WARN L322 ript$VariableManager]: TermVariabe t1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,673 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,673 WARN L322 ript$VariableManager]: TermVariabe |t1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,676 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,677 WARN L322 ript$VariableManager]: TermVariabe t2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,677 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,677 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#t~post2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,677 WARN L322 ript$VariableManager]: TermVariabe |t2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-17 22:04:44,678 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-17 22:04:44,718 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 22:04:44,724 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 [2021-12-17 22:04:44,724 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-12-17 22:04:44,733 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 96 places, 96 transitions, 202 flow [2021-12-17 22:04:44,766 INFO L129 PetriNetUnfolder]: 7/94 cut-off events. [2021-12-17 22:04:44,767 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:04:44,771 INFO L84 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 7/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2021-12-17 22:04:44,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 96 transitions, 202 flow [2021-12-17 22:04:44,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 94 transitions, 194 flow [2021-12-17 22:04:44,797 INFO L129 PetriNetUnfolder]: 7/85 cut-off events. [2021-12-17 22:04:44,797 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:04:44,797 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:04:44,798 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:04:44,798 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:04:44,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:04:44,803 INFO L85 PathProgramCache]: Analyzing trace with hash -2078106083, now seen corresponding path program 1 times [2021-12-17 22:04:44,813 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:04:44,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586289535] [2021-12-17 22:04:44,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:04:44,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:04:44,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:04:44,819 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:04:44,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 22:04:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:04:44,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 22:04:44,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:04:45,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:45,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 22:04:45,042 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:04:45,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586289535] [2021-12-17 22:04:45,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586289535] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:04:45,043 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:04:45,044 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 22:04:45,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51098902] [2021-12-17 22:04:45,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:04:45,053 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 22:04:45,053 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:04:45,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 22:04:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 22:04:45,084 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 96 [2021-12-17 22:04:45,089 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 194 flow. Second operand has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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) [2021-12-17 22:04:45,089 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:04:45,089 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 96 [2021-12-17 22:04:45,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:04:45,126 INFO L129 PetriNetUnfolder]: 3/89 cut-off events. [2021-12-17 22:04:45,127 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-12-17 22:04:45,128 INFO L84 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 3/89 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 5/90 useless extension candidates. Maximal degree in co-relation 59. Up to 3 conditions per place. [2021-12-17 22:04:45,135 INFO L132 encePairwiseOnDemand]: 92/96 looper letters, 2 selfloop transitions, 0 changer transitions 0/89 dead transitions. [2021-12-17 22:04:45,135 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 89 transitions, 188 flow [2021-12-17 22:04:45,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 22:04:45,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2021-12-17 22:04:45,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 184 transitions. [2021-12-17 22:04:45,146 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9583333333333334 [2021-12-17 22:04:45,146 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 184 transitions. [2021-12-17 22:04:45,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 184 transitions. [2021-12-17 22:04:45,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:04:45,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 184 transitions. [2021-12-17 22:04:45,155 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 92.0) internal successors, (184), 2 states have internal predecessors, (184), 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) [2021-12-17 22:04:45,160 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:04:45,160 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 22:04:45,162 INFO L186 Difference]: Start difference. First operand has 94 places, 94 transitions, 194 flow. Second operand 2 states and 184 transitions. [2021-12-17 22:04:45,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 89 transitions, 188 flow [2021-12-17 22:04:45,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 89 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-17 22:04:45,168 INFO L242 Difference]: Finished difference. Result has 92 places, 89 transitions, 182 flow [2021-12-17 22:04:45,169 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=182, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2021-12-17 22:04:45,173 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2021-12-17 22:04:45,173 INFO L470 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 182 flow [2021-12-17 22:04:45,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 90.5) internal successors, (181), 2 states have internal predecessors, (181), 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) [2021-12-17 22:04:45,173 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:04:45,174 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:04:45,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-17 22:04:45,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 22:04:45,383 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:04:45,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:04:45,383 INFO L85 PathProgramCache]: Analyzing trace with hash -335295748, now seen corresponding path program 1 times [2021-12-17 22:04:45,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:04:45,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2075270823] [2021-12-17 22:04:45,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:04:45,384 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:04:45,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:04:45,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:04:45,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 22:04:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:04:45,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 22:04:45,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:04:45,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:45,553 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 22:04:45,553 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:04:45,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2075270823] [2021-12-17 22:04:45,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2075270823] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 22:04:45,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 22:04:45,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 22:04:45,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025113226] [2021-12-17 22:04:45,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 22:04:45,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 22:04:45,555 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:04:45,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 22:04:45,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 22:04:45,556 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2021-12-17 22:04:45,557 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2021-12-17 22:04:45,557 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:04:45,557 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2021-12-17 22:04:45,557 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:04:45,580 INFO L129 PetriNetUnfolder]: 3/95 cut-off events. [2021-12-17 22:04:45,580 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-17 22:04:45,580 INFO L84 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 110. Up to 6 conditions per place. [2021-12-17 22:04:45,581 INFO L132 encePairwiseOnDemand]: 93/96 looper letters, 9 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2021-12-17 22:04:45,581 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 210 flow [2021-12-17 22:04:45,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 22:04:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-17 22:04:45,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 261 transitions. [2021-12-17 22:04:45,592 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.90625 [2021-12-17 22:04:45,592 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 261 transitions. [2021-12-17 22:04:45,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 261 transitions. [2021-12-17 22:04:45,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:04:45,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 261 transitions. [2021-12-17 22:04:45,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 87.0) internal successors, (261), 3 states have internal predecessors, (261), 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) [2021-12-17 22:04:45,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2021-12-17 22:04:45,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 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) [2021-12-17 22:04:45,597 INFO L186 Difference]: Start difference. First operand has 92 places, 89 transitions, 182 flow. Second operand 3 states and 261 transitions. [2021-12-17 22:04:45,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 210 flow [2021-12-17 22:04:45,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2021-12-17 22:04:45,600 INFO L242 Difference]: Finished difference. Result has 95 places, 90 transitions, 194 flow [2021-12-17 22:04:45,601 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=95, PETRI_TRANSITIONS=90} [2021-12-17 22:04:45,601 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 1 predicate places. [2021-12-17 22:04:45,601 INFO L470 AbstractCegarLoop]: Abstraction has has 95 places, 90 transitions, 194 flow [2021-12-17 22:04:45,602 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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) [2021-12-17 22:04:45,602 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:04:45,602 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:04:45,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2021-12-17 22:04:45,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 22:04:45,813 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:04:45,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:04:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -2079289939, now seen corresponding path program 1 times [2021-12-17 22:04:45,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:04:45,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75677673] [2021-12-17 22:04:45,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:04:45,814 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:04:45,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:04:45,815 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:04:45,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 22:04:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:04:45,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-17 22:04:45,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:04:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:45,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:04:46,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:46,076 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:04:46,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75677673] [2021-12-17 22:04:46,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75677673] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:04:46,076 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:04:46,076 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2021-12-17 22:04:46,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370580766] [2021-12-17 22:04:46,077 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 22:04:46,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 22:04:46,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:04:46,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 22:04:46,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-12-17 22:04:46,080 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2021-12-17 22:04:46,081 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 90 transitions, 194 flow. Second operand has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 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) [2021-12-17 22:04:46,082 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:04:46,083 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2021-12-17 22:04:46,083 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:04:46,170 INFO L129 PetriNetUnfolder]: 3/104 cut-off events. [2021-12-17 22:04:46,170 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2021-12-17 22:04:46,172 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 104 events. 3/104 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 2/103 useless extension candidates. Maximal degree in co-relation 133. Up to 6 conditions per place. [2021-12-17 22:04:46,173 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 10 selfloop transitions, 9 changer transitions 0/98 dead transitions. [2021-12-17 22:04:46,173 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 98 transitions, 250 flow [2021-12-17 22:04:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-17 22:04:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-17 22:04:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 750 transitions. [2021-12-17 22:04:46,176 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2021-12-17 22:04:46,177 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 750 transitions. [2021-12-17 22:04:46,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 750 transitions. [2021-12-17 22:04:46,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:04:46,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 750 transitions. [2021-12-17 22:04:46,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 83.33333333333333) internal successors, (750), 9 states have internal predecessors, (750), 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) [2021-12-17 22:04:46,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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) [2021-12-17 22:04:46,181 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 96.0) internal successors, (960), 10 states have internal predecessors, (960), 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) [2021-12-17 22:04:46,181 INFO L186 Difference]: Start difference. First operand has 95 places, 90 transitions, 194 flow. Second operand 9 states and 750 transitions. [2021-12-17 22:04:46,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 98 transitions, 250 flow [2021-12-17 22:04:46,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 98 transitions, 248 flow, removed 0 selfloop flow, removed 1 redundant places. [2021-12-17 22:04:46,186 INFO L242 Difference]: Finished difference. Result has 105 places, 96 transitions, 242 flow [2021-12-17 22:04:46,186 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=242, PETRI_PLACES=105, PETRI_TRANSITIONS=96} [2021-12-17 22:04:46,188 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 11 predicate places. [2021-12-17 22:04:46,188 INFO L470 AbstractCegarLoop]: Abstraction has has 105 places, 96 transitions, 242 flow [2021-12-17 22:04:46,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 83.0) internal successors, (664), 8 states have internal predecessors, (664), 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) [2021-12-17 22:04:46,189 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:04:46,189 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:04:46,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-17 22:04:46,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 22:04:46,400 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:04:46,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:04:46,400 INFO L85 PathProgramCache]: Analyzing trace with hash 2004568781, now seen corresponding path program 2 times [2021-12-17 22:04:46,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:04:46,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422996229] [2021-12-17 22:04:46,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:04:46,401 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:04:46,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:04:46,402 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:04:46,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 22:04:46,472 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:04:46,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:04:46,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-17 22:04:46,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:04:47,060 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:47,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:04:47,871 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:47,871 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:04:47,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422996229] [2021-12-17 22:04:47,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422996229] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:04:47,872 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:04:47,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2021-12-17 22:04:47,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303454405] [2021-12-17 22:04:47,872 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 22:04:47,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-17 22:04:47,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:04:47,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-17 22:04:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2021-12-17 22:04:47,875 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2021-12-17 22:04:47,877 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 96 transitions, 242 flow. Second operand has 28 states, 28 states have (on average 70.71428571428571) internal successors, (1980), 28 states have internal predecessors, (1980), 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) [2021-12-17 22:04:47,877 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:04:47,877 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2021-12-17 22:04:47,878 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:04:51,254 INFO L129 PetriNetUnfolder]: 384/1171 cut-off events. [2021-12-17 22:04:51,254 INFO L130 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2021-12-17 22:04:51,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1965 conditions, 1171 events. 384/1171 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6177 event pairs, 2 based on Foata normal form. 0/1117 useless extension candidates. Maximal degree in co-relation 1958. Up to 300 conditions per place. [2021-12-17 22:04:51,262 INFO L132 encePairwiseOnDemand]: 81/96 looper letters, 54 selfloop transitions, 132 changer transitions 10/270 dead transitions. [2021-12-17 22:04:51,262 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 270 transitions, 984 flow [2021-12-17 22:04:51,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2021-12-17 22:04:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2021-12-17 22:04:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 3649 transitions. [2021-12-17 22:04:51,269 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7602083333333334 [2021-12-17 22:04:51,269 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 3649 transitions. [2021-12-17 22:04:51,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 3649 transitions. [2021-12-17 22:04:51,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:04:51,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 3649 transitions. [2021-12-17 22:04:51,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 72.98) internal successors, (3649), 50 states have internal predecessors, (3649), 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) [2021-12-17 22:04:51,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 96.0) internal successors, (4896), 51 states have internal predecessors, (4896), 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) [2021-12-17 22:04:51,284 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 96.0) internal successors, (4896), 51 states have internal predecessors, (4896), 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) [2021-12-17 22:04:51,285 INFO L186 Difference]: Start difference. First operand has 105 places, 96 transitions, 242 flow. Second operand 50 states and 3649 transitions. [2021-12-17 22:04:51,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 270 transitions, 984 flow [2021-12-17 22:04:51,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 270 transitions, 978 flow, removed 2 selfloop flow, removed 1 redundant places. [2021-12-17 22:04:51,290 INFO L242 Difference]: Finished difference. Result has 174 places, 239 transitions, 971 flow [2021-12-17 22:04:51,290 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=971, PETRI_PLACES=174, PETRI_TRANSITIONS=239} [2021-12-17 22:04:51,291 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 80 predicate places. [2021-12-17 22:04:51,291 INFO L470 AbstractCegarLoop]: Abstraction has has 174 places, 239 transitions, 971 flow [2021-12-17 22:04:51,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 70.71428571428571) internal successors, (1980), 28 states have internal predecessors, (1980), 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) [2021-12-17 22:04:51,292 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:04:51,292 INFO L254 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:04:51,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 22:04:51,500 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 22:04:51,500 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:04:51,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:04:51,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1548347184, now seen corresponding path program 1 times [2021-12-17 22:04:51,501 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:04:51,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922927585] [2021-12-17 22:04:51,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:04:51,502 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:04:51,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:04:51,503 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:04:51,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 22:04:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:04:51,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-17 22:04:51,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:04:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:51,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:04:51,895 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:51,896 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:04:51,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922927585] [2021-12-17 22:04:51,896 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922927585] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:04:51,896 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:04:51,897 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2021-12-17 22:04:51,897 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922725252] [2021-12-17 22:04:51,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 22:04:51,899 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-12-17 22:04:51,899 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:04:51,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-12-17 22:04:51,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2021-12-17 22:04:51,900 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2021-12-17 22:04:51,901 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 239 transitions, 971 flow. Second operand has 16 states, 16 states have (on average 83.0) internal successors, (1328), 16 states have internal predecessors, (1328), 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) [2021-12-17 22:04:51,902 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:04:51,902 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2021-12-17 22:04:51,902 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:04:52,328 INFO L129 PetriNetUnfolder]: 275/962 cut-off events. [2021-12-17 22:04:52,328 INFO L130 PetriNetUnfolder]: For 1098/1100 co-relation queries the response was YES. [2021-12-17 22:04:52,342 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2210 conditions, 962 events. 275/962 cut-off events. For 1098/1100 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4693 event pairs, 0 based on Foata normal form. 27/949 useless extension candidates. Maximal degree in co-relation 2181. Up to 229 conditions per place. [2021-12-17 22:04:52,347 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 14 selfloop transitions, 21 changer transitions 10/221 dead transitions. [2021-12-17 22:04:52,347 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 221 transitions, 929 flow [2021-12-17 22:04:52,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 22:04:52,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2021-12-17 22:04:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1740 transitions. [2021-12-17 22:04:52,351 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8630952380952381 [2021-12-17 22:04:52,351 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1740 transitions. [2021-12-17 22:04:52,351 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1740 transitions. [2021-12-17 22:04:52,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:04:52,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1740 transitions. [2021-12-17 22:04:52,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 82.85714285714286) internal successors, (1740), 21 states have internal predecessors, (1740), 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) [2021-12-17 22:04:52,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 96.0) internal successors, (2112), 22 states have internal predecessors, (2112), 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) [2021-12-17 22:04:52,359 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 96.0) internal successors, (2112), 22 states have internal predecessors, (2112), 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) [2021-12-17 22:04:52,359 INFO L186 Difference]: Start difference. First operand has 174 places, 239 transitions, 971 flow. Second operand 21 states and 1740 transitions. [2021-12-17 22:04:52,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 221 transitions, 929 flow [2021-12-17 22:04:52,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 221 transitions, 893 flow, removed 15 selfloop flow, removed 14 redundant places. [2021-12-17 22:04:52,372 INFO L242 Difference]: Finished difference. Result has 171 places, 206 transitions, 841 flow [2021-12-17 22:04:52,372 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=735, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=841, PETRI_PLACES=171, PETRI_TRANSITIONS=206} [2021-12-17 22:04:52,374 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 77 predicate places. [2021-12-17 22:04:52,375 INFO L470 AbstractCegarLoop]: Abstraction has has 171 places, 206 transitions, 841 flow [2021-12-17 22:04:52,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 83.0) internal successors, (1328), 16 states have internal predecessors, (1328), 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) [2021-12-17 22:04:52,375 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:04:52,376 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:04:52,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 22:04:52,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 22:04:52,586 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:04:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:04:52,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1738646259, now seen corresponding path program 3 times [2021-12-17 22:04:52,587 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:04:52,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293663059] [2021-12-17 22:04:52,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 22:04:52,587 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:04:52,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:04:52,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:04:52,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-17 22:04:52,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2021-12-17 22:04:52,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:04:52,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 26 conjunts are in the unsatisfiable core [2021-12-17 22:04:52,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:04:53,741 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:53,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:04:56,793 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:04:56,794 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:04:56,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293663059] [2021-12-17 22:04:56,794 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1293663059] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:04:56,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:04:56,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2021-12-17 22:04:56,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663084861] [2021-12-17 22:04:56,794 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 22:04:56,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2021-12-17 22:04:56,795 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:04:56,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2021-12-17 22:04:56,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=2399, Unknown=0, NotChecked=0, Total=2652 [2021-12-17 22:04:56,800 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2021-12-17 22:04:56,802 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 206 transitions, 841 flow. Second operand has 52 states, 52 states have (on average 70.38461538461539) internal successors, (3660), 52 states have internal predecessors, (3660), 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) [2021-12-17 22:04:56,802 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:04:56,803 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2021-12-17 22:04:56,803 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:06:37,491 INFO L129 PetriNetUnfolder]: 1434/3662 cut-off events. [2021-12-17 22:06:37,491 INFO L130 PetriNetUnfolder]: For 7227/7379 co-relation queries the response was YES. [2021-12-17 22:06:37,518 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10606 conditions, 3662 events. 1434/3662 cut-off events. For 7227/7379 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 22987 event pairs, 1 based on Foata normal form. 104/3634 useless extension candidates. Maximal degree in co-relation 10585. Up to 1514 conditions per place. [2021-12-17 22:06:37,537 INFO L132 encePairwiseOnDemand]: 82/96 looper letters, 78 selfloop transitions, 617 changer transitions 0/774 dead transitions. [2021-12-17 22:06:37,538 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 774 transitions, 5095 flow [2021-12-17 22:06:37,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2021-12-17 22:06:37,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2021-12-17 22:06:37,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 13465 transitions. [2021-12-17 22:06:37,581 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7540882616487455 [2021-12-17 22:06:37,582 INFO L72 ComplementDD]: Start complementDD. Operand 186 states and 13465 transitions. [2021-12-17 22:06:37,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 186 states and 13465 transitions. [2021-12-17 22:06:37,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:06:37,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 186 states and 13465 transitions. [2021-12-17 22:06:37,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 187 states, 186 states have (on average 72.39247311827957) internal successors, (13465), 186 states have internal predecessors, (13465), 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) [2021-12-17 22:06:37,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 187 states, 187 states have (on average 96.0) internal successors, (17952), 187 states have internal predecessors, (17952), 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) [2021-12-17 22:06:37,720 INFO L81 ComplementDD]: Finished complementDD. Result has 187 states, 187 states have (on average 96.0) internal successors, (17952), 187 states have internal predecessors, (17952), 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) [2021-12-17 22:06:37,720 INFO L186 Difference]: Start difference. First operand has 171 places, 206 transitions, 841 flow. Second operand 186 states and 13465 transitions. [2021-12-17 22:06:37,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 774 transitions, 5095 flow [2021-12-17 22:06:37,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 774 transitions, 5071 flow, removed 6 selfloop flow, removed 6 redundant places. [2021-12-17 22:06:37,755 INFO L242 Difference]: Finished difference. Result has 349 places, 758 transitions, 5018 flow [2021-12-17 22:06:37,756 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=817, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=186, PETRI_FLOW=5018, PETRI_PLACES=349, PETRI_TRANSITIONS=758} [2021-12-17 22:06:37,756 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 255 predicate places. [2021-12-17 22:06:37,757 INFO L470 AbstractCegarLoop]: Abstraction has has 349 places, 758 transitions, 5018 flow [2021-12-17 22:06:37,758 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 70.38461538461539) internal successors, (3660), 52 states have internal predecessors, (3660), 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) [2021-12-17 22:06:37,758 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:06:37,758 INFO L254 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:06:37,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-17 22:06:37,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 22:06:37,967 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:06:37,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:06:37,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1168339269, now seen corresponding path program 1 times [2021-12-17 22:06:37,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:06:37,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374200280] [2021-12-17 22:06:37,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 22:06:37,968 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:06:37,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:06:37,969 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:06:37,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-17 22:06:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 22:06:38,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 22:06:38,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:06:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:06:38,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:06:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:06:38,988 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:06:38,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374200280] [2021-12-17 22:06:38,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374200280] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:06:38,988 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:06:38,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2021-12-17 22:06:38,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829977060] [2021-12-17 22:06:38,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 22:06:38,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2021-12-17 22:06:38,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:06:38,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-12-17 22:06:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=827, Unknown=0, NotChecked=0, Total=992 [2021-12-17 22:06:38,991 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 96 [2021-12-17 22:06:38,992 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 758 transitions, 5018 flow. Second operand has 32 states, 32 states have (on average 83.0) internal successors, (2656), 32 states have internal predecessors, (2656), 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) [2021-12-17 22:06:38,992 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:06:38,992 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 96 [2021-12-17 22:06:38,992 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:06:40,853 INFO L129 PetriNetUnfolder]: 1457/3745 cut-off events. [2021-12-17 22:06:40,853 INFO L130 PetriNetUnfolder]: For 10704/10764 co-relation queries the response was YES. [2021-12-17 22:06:40,870 INFO L84 FinitePrefix]: Finished finitePrefix Result has 12166 conditions, 3745 events. 1457/3745 cut-off events. For 10704/10764 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23149 event pairs, 1 based on Foata normal form. 70/3697 useless extension candidates. Maximal degree in co-relation 12135. Up to 1670 conditions per place. [2021-12-17 22:06:40,887 INFO L132 encePairwiseOnDemand]: 90/96 looper letters, 19 selfloop transitions, 36 changer transitions 0/675 dead transitions. [2021-12-17 22:06:40,888 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 675 transitions, 4724 flow [2021-12-17 22:06:40,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2021-12-17 22:06:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-12-17 22:06:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2976 transitions. [2021-12-17 22:06:40,890 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8611111111111112 [2021-12-17 22:06:40,890 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 2976 transitions. [2021-12-17 22:06:40,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 2976 transitions. [2021-12-17 22:06:40,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-17 22:06:40,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2976 transitions. [2021-12-17 22:06:40,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 82.66666666666667) internal successors, (2976), 36 states have internal predecessors, (2976), 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) [2021-12-17 22:06:40,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 96.0) internal successors, (3552), 37 states have internal predecessors, (3552), 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) [2021-12-17 22:06:40,898 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 96.0) internal successors, (3552), 37 states have internal predecessors, (3552), 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) [2021-12-17 22:06:40,898 INFO L186 Difference]: Start difference. First operand has 349 places, 758 transitions, 5018 flow. Second operand 36 states and 2976 transitions. [2021-12-17 22:06:40,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 675 transitions, 4724 flow [2021-12-17 22:06:40,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 675 transitions, 3255 flow, removed 670 selfloop flow, removed 31 redundant places. [2021-12-17 22:06:40,977 INFO L242 Difference]: Finished difference. Result has 327 places, 666 transitions, 3175 flow [2021-12-17 22:06:40,985 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=2963, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3175, PETRI_PLACES=327, PETRI_TRANSITIONS=666} [2021-12-17 22:06:40,985 INFO L334 CegarLoopForPetriNet]: 94 programPoint places, 233 predicate places. [2021-12-17 22:06:40,986 INFO L470 AbstractCegarLoop]: Abstraction has has 327 places, 666 transitions, 3175 flow [2021-12-17 22:06:40,986 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 83.0) internal successors, (2656), 32 states have internal predecessors, (2656), 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) [2021-12-17 22:06:40,986 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-17 22:06:40,987 INFO L254 CegarLoopForPetriNet]: trace histogram [12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 22:06:41,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2021-12-17 22:06:41,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 22:06:41,188 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-12-17 22:06:41,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 22:06:41,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1774414145, now seen corresponding path program 2 times [2021-12-17 22:06:41,188 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 22:06:41,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963598225] [2021-12-17 22:06:41,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 22:06:41,189 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 22:06:41,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 22:06:41,190 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 22:06:41,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-17 22:06:41,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 22:06:41,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 22:06:41,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 42 conjunts are in the unsatisfiable core [2021-12-17 22:06:41,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 22:06:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:06:43,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 22:06:55,750 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 22:06:55,750 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 22:06:55,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963598225] [2021-12-17 22:06:55,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963598225] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 22:06:55,750 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 22:06:55,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 84 [2021-12-17 22:06:55,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151173827] [2021-12-17 22:06:55,751 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 22:06:55,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2021-12-17 22:06:55,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 22:06:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2021-12-17 22:06:55,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=618, Invalid=6354, Unknown=0, NotChecked=0, Total=6972 [2021-12-17 22:06:55,755 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2021-12-17 22:06:55,758 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 666 transitions, 3175 flow. Second operand has 84 states, 84 states have (on average 70.23809523809524) internal successors, (5900), 84 states have internal predecessors, (5900), 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) [2021-12-17 22:06:55,758 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-17 22:06:55,758 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2021-12-17 22:06:55,758 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-17 22:07:12,392 WARN L227 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 145 DAG size of output: 139 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:07:39,921 WARN L227 SmtUtils]: Spent 17.02s on a formula simplification. DAG size of input: 120 DAG size of output: 93 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:08:00,183 WARN L227 SmtUtils]: Spent 17.94s on a formula simplification. DAG size of input: 118 DAG size of output: 87 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:08:11,467 WARN L227 SmtUtils]: Spent 5.04s on a formula simplification. DAG size of input: 136 DAG size of output: 131 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:08:44,686 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:09:22,836 WARN L227 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 105 DAG size of output: 76 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:09:28,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:09:30,079 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 22:09:51,979 WARN L227 SmtUtils]: Spent 5.79s on a formula simplification. DAG size of input: 133 DAG size of output: 128 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:10:19,477 WARN L227 SmtUtils]: Spent 11.51s on a formula simplification. DAG size of input: 139 DAG size of output: 133 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 22:10:21,525 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15