/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 13:53:25,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 13:53:26,008 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 13:53:26,012 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 13:53:26,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 13:53:26,046 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 13:53:26,047 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 13:53:26,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 13:53:26,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 13:53:26,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 13:53:26,050 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 13:53:26,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 13:53:26,051 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 13:53:26,051 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 13:53:26,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 13:53:26,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 13:53:26,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 13:53:26,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 13:53:26,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 13:53:26,052 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 13:53:26,053 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 13:53:26,053 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 13:53:26,054 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 13:53:26,054 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 13:53:26,054 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 13:53:26,055 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 13:53:26,055 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 13:53:26,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 13:53:26,055 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 13:53:26,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 13:53:26,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 13:53:26,057 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 13:53:26,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 13:53:26,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 13:53:26,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 13:53:26,057 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 13:53:26,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 13:53:26,389 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 13:53:26,391 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 13:53:26,392 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 13:53:26,392 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 13:53:26,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2023-08-26 13:53:27,638 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 13:53:27,918 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 13:53:27,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2023-08-26 13:53:27,931 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c0b31f6/b842e98827ab492c9fb9d6290d7f911c/FLAGd8eb73cce [2023-08-26 13:53:27,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56c0b31f6/b842e98827ab492c9fb9d6290d7f911c [2023-08-26 13:53:27,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 13:53:27,946 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 13:53:27,946 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 13:53:27,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 13:53:27,954 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 13:53:27,955 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:53:27" (1/1) ... [2023-08-26 13:53:27,956 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d3f493d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:27, skipping insertion in model container [2023-08-26 13:53:27,956 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:53:27" (1/1) ... [2023-08-26 13:53:28,013 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 13:53:28,331 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 13:53:28,344 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 13:53:28,368 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [208] [2023-08-26 13:53:28,380 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [209] [2023-08-26 13:53:28,398 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 13:53:28,433 INFO L206 MainTranslator]: Completed translation [2023-08-26 13:53:28,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28 WrapperNode [2023-08-26 13:53:28,433 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 13:53:28,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 13:53:28,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 13:53:28,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 13:53:28,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,472 INFO L138 Inliner]: procedures = 168, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-08-26 13:53:28,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 13:53:28,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 13:53:28,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 13:53:28,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 13:53:28,481 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,481 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,484 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,484 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,496 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,499 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 13:53:28,506 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 13:53:28,506 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 13:53:28,506 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 13:53:28,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (1/1) ... [2023-08-26 13:53:28,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 13:53:28,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:28,539 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) [2023-08-26 13:53:28,561 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 [2023-08-26 13:53:28,589 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 13:53:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-08-26 13:53:28,590 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-08-26 13:53:28,590 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-08-26 13:53:28,590 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-08-26 13:53:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 13:53:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 13:53:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 13:53:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 13:53:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 13:53:28,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-08-26 13:53:28,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 13:53:28,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 13:53:28,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 13:53:28,594 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 13:53:28,759 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 13:53:28,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 13:53:29,105 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 13:53:29,112 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 13:53:29,112 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 13:53:29,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:53:29 BoogieIcfgContainer [2023-08-26 13:53:29,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 13:53:29,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 13:53:29,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 13:53:29,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 13:53:29,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:53:27" (1/3) ... [2023-08-26 13:53:29,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afcd3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:53:29, skipping insertion in model container [2023-08-26 13:53:29,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:53:28" (2/3) ... [2023-08-26 13:53:29,125 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afcd3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:53:29, skipping insertion in model container [2023-08-26 13:53:29,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:53:29" (3/3) ... [2023-08-26 13:53:29,126 INFO L112 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2023-08-26 13:53:29,141 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 13:53:29,141 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2023-08-26 13:53:29,141 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 13:53:29,239 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 13:53:29,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 172 transitions, 360 flow [2023-08-26 13:53:29,335 INFO L124 PetriNetUnfolderBase]: 14/170 cut-off events. [2023-08-26 13:53:29,335 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 13:53:29,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 14/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 389 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2023-08-26 13:53:29,347 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 172 transitions, 360 flow [2023-08-26 13:53:29,355 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 161 transitions, 331 flow [2023-08-26 13:53:29,357 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 13:53:29,365 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 154 places, 161 transitions, 331 flow [2023-08-26 13:53:29,367 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 154 places, 161 transitions, 331 flow [2023-08-26 13:53:29,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 161 transitions, 331 flow [2023-08-26 13:53:29,398 INFO L124 PetriNetUnfolderBase]: 14/161 cut-off events. [2023-08-26 13:53:29,398 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 13:53:29,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 169 conditions, 161 events. 14/161 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 366 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2023-08-26 13:53:29,403 INFO L119 LiptonReduction]: Number of co-enabled transitions 6922 [2023-08-26 13:53:34,971 INFO L134 LiptonReduction]: Checked pairs total: 17080 [2023-08-26 13:53:34,971 INFO L136 LiptonReduction]: Total number of compositions: 172 [2023-08-26 13:53:34,983 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 13:53:34,988 INFO L357 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=false, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2a8f2ae8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 13:53:34,988 INFO L358 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-08-26 13:53:34,989 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 13:53:34,989 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 13:53:34,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 13:53:34,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:34,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 13:53:34,990 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:34,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:34,994 INFO L85 PathProgramCache]: Analyzing trace with hash 708, now seen corresponding path program 1 times [2023-08-26 13:53:35,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:35,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737574988] [2023-08-26 13:53:35,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:35,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:35,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:35,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:35,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737574988] [2023-08-26 13:53:35,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737574988] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:35,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:35,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 13:53:35,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422502075] [2023-08-26 13:53:35,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:35,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 13:53:35,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:35,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 13:53:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 13:53:35,115 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 344 [2023-08-26 13:53:35,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 51 transitions, 111 flow. Second operand has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 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) [2023-08-26 13:53:35,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:35,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 344 [2023-08-26 13:53:35,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:35,400 INFO L124 PetriNetUnfolderBase]: 1468/2378 cut-off events. [2023-08-26 13:53:35,401 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2023-08-26 13:53:35,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 2378 events. 1468/2378 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 12410 event pairs, 1176 based on Foata normal form. 56/1307 useless extension candidates. Maximal degree in co-relation 4357. Up to 2190 conditions per place. [2023-08-26 13:53:35,421 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 41 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2023-08-26 13:53:35,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 47 transitions, 185 flow [2023-08-26 13:53:35,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 13:53:35,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 13:53:35,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 359 transitions. [2023-08-26 13:53:35,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5218023255813954 [2023-08-26 13:53:35,440 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 359 transitions. [2023-08-26 13:53:35,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 359 transitions. [2023-08-26 13:53:35,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:35,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 359 transitions. [2023-08-26 13:53:35,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 179.5) internal successors, (359), 2 states have internal predecessors, (359), 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) [2023-08-26 13:53:35,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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) [2023-08-26 13:53:35,456 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 344.0) internal successors, (1032), 3 states have internal predecessors, (1032), 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) [2023-08-26 13:53:35,457 INFO L175 Difference]: Start difference. First operand has 50 places, 51 transitions, 111 flow. Second operand 2 states and 359 transitions. [2023-08-26 13:53:35,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 47 transitions, 185 flow [2023-08-26 13:53:35,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 47 transitions, 180 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 13:53:35,464 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 98 flow [2023-08-26 13:53:35,466 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-08-26 13:53:35,472 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 13:53:35,472 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 98 flow [2023-08-26 13:53:35,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 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) [2023-08-26 13:53:35,473 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:35,473 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 13:53:35,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 13:53:35,474 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:35,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:35,475 INFO L85 PathProgramCache]: Analyzing trace with hash 698611, now seen corresponding path program 1 times [2023-08-26 13:53:35,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:35,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090101831] [2023-08-26 13:53:35,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:35,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:35,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:35,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:35,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090101831] [2023-08-26 13:53:35,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090101831] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:35,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:35,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:53:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131218253] [2023-08-26 13:53:35,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:35,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:35,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:35,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:35,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 344 [2023-08-26 13:53:35,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-26 13:53:35,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:35,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 344 [2023-08-26 13:53:35,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:35,930 INFO L124 PetriNetUnfolderBase]: 1438/2318 cut-off events. [2023-08-26 13:53:35,931 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 13:53:35,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 2318 events. 1438/2318 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 12025 event pairs, 1152 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 4479. Up to 2134 conditions per place. [2023-08-26 13:53:35,947 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 38 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-26 13:53:35,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 172 flow [2023-08-26 13:53:35,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-26 13:53:35,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42926356589147285 [2023-08-26 13:53:35,950 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-26 13:53:35,951 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-26 13:53:35,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:35,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-26 13:53:35,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-26 13:53:35,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:35,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:35,957 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 98 flow. Second operand 3 states and 443 transitions. [2023-08-26 13:53:35,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 172 flow [2023-08-26 13:53:35,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 172 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 13:53:35,959 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 96 flow [2023-08-26 13:53:35,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-26 13:53:35,960 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 13:53:35,961 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 96 flow [2023-08-26 13:53:35,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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) [2023-08-26 13:53:35,964 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:35,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 13:53:35,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 13:53:35,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:35,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:35,967 INFO L85 PathProgramCache]: Analyzing trace with hash 698610, now seen corresponding path program 1 times [2023-08-26 13:53:35,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:35,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421002123] [2023-08-26 13:53:35,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:35,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:36,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:36,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421002123] [2023-08-26 13:53:36,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421002123] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:36,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:36,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:53:36,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938066767] [2023-08-26 13:53:36,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:36,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:36,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:36,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:36,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:36,080 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 344 [2023-08-26 13:53:36,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2023-08-26 13:53:36,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:36,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 344 [2023-08-26 13:53:36,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:36,248 INFO L124 PetriNetUnfolderBase]: 1408/2258 cut-off events. [2023-08-26 13:53:36,249 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 13:53:36,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4369 conditions, 2258 events. 1408/2258 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 11630 event pairs, 1128 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 4365. Up to 2079 conditions per place. [2023-08-26 13:53:36,262 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 36 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 13:53:36,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 43 transitions, 166 flow [2023-08-26 13:53:36,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:36,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:36,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2023-08-26 13:53:36,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42151162790697677 [2023-08-26 13:53:36,265 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 435 transitions. [2023-08-26 13:53:36,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 435 transitions. [2023-08-26 13:53:36,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:36,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 435 transitions. [2023-08-26 13:53:36,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-08-26 13:53:36,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:36,269 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:36,269 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 96 flow. Second operand 3 states and 435 transitions. [2023-08-26 13:53:36,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 43 transitions, 166 flow [2023-08-26 13:53:36,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 43 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:36,270 INFO L231 Difference]: Finished difference. Result has 45 places, 43 transitions, 93 flow [2023-08-26 13:53:36,270 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=45, PETRI_TRANSITIONS=43} [2023-08-26 13:53:36,271 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -5 predicate places. [2023-08-26 13:53:36,271 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 43 transitions, 93 flow [2023-08-26 13:53:36,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 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) [2023-08-26 13:53:36,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:36,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 13:53:36,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 13:53:36,272 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:36,272 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 671354704, now seen corresponding path program 1 times [2023-08-26 13:53:36,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:36,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316079590] [2023-08-26 13:53:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:36,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:36,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316079590] [2023-08-26 13:53:36,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316079590] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:36,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:36,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:53:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21069526] [2023-08-26 13:53:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:36,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:36,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:36,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:36,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:36,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 344 [2023-08-26 13:53:36,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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) [2023-08-26 13:53:36,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:36,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 344 [2023-08-26 13:53:36,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:36,785 INFO L124 PetriNetUnfolderBase]: 2169/3527 cut-off events. [2023-08-26 13:53:36,785 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-26 13:53:36,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6808 conditions, 3527 events. 2169/3527 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 18316 event pairs, 839 based on Foata normal form. 0/1942 useless extension candidates. Maximal degree in co-relation 6804. Up to 1933 conditions per place. [2023-08-26 13:53:36,806 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 63 selfloop transitions, 3 changer transitions 0/72 dead transitions. [2023-08-26 13:53:36,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 286 flow [2023-08-26 13:53:36,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:36,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 13:53:36,809 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312015503875969 [2023-08-26 13:53:36,809 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 13:53:36,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 13:53:36,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:36,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 13:53:36,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2023-08-26 13:53:36,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:36,813 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:36,813 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 93 flow. Second operand 3 states and 445 transitions. [2023-08-26 13:53:36,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 286 flow [2023-08-26 13:53:36,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 72 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:36,815 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 117 flow [2023-08-26 13:53:36,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=117, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2023-08-26 13:53:36,816 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -3 predicate places. [2023-08-26 13:53:36,816 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 117 flow [2023-08-26 13:53:36,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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) [2023-08-26 13:53:36,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:36,817 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 13:53:36,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 13:53:36,817 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:36,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:36,818 INFO L85 PathProgramCache]: Analyzing trace with hash 671354706, now seen corresponding path program 1 times [2023-08-26 13:53:36,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:36,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431512600] [2023-08-26 13:53:36,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:36,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:36,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:36,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:36,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:36,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431512600] [2023-08-26 13:53:36,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431512600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:36,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:36,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:53:36,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383745477] [2023-08-26 13:53:36,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:36,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:36,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:36,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:36,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:36,910 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 344 [2023-08-26 13:53:36,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-26 13:53:36,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:36,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 344 [2023-08-26 13:53:36,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:37,145 INFO L124 PetriNetUnfolderBase]: 2005/3241 cut-off events. [2023-08-26 13:53:37,145 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-08-26 13:53:37,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6652 conditions, 3241 events. 2005/3241 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 16493 event pairs, 1535 based on Foata normal form. 0/1978 useless extension candidates. Maximal degree in co-relation 6647. Up to 2952 conditions per place. [2023-08-26 13:53:37,163 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 36 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2023-08-26 13:53:37,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 185 flow [2023-08-26 13:53:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2023-08-26 13:53:37,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41957364341085274 [2023-08-26 13:53:37,166 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 433 transitions. [2023-08-26 13:53:37,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 433 transitions. [2023-08-26 13:53:37,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:37,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 433 transitions. [2023-08-26 13:53:37,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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) [2023-08-26 13:53:37,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,170 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,170 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 117 flow. Second operand 3 states and 433 transitions. [2023-08-26 13:53:37,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 185 flow [2023-08-26 13:53:37,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 43 transitions, 182 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:37,172 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 110 flow [2023-08-26 13:53:37,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-26 13:53:37,173 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 13:53:37,173 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 110 flow [2023-08-26 13:53:37,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-26 13:53:37,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:37,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 13:53:37,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 13:53:37,174 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:37,174 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:37,174 INFO L85 PathProgramCache]: Analyzing trace with hash 671382345, now seen corresponding path program 1 times [2023-08-26 13:53:37,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:37,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036281020] [2023-08-26 13:53:37,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:37,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:37,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:37,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:37,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036281020] [2023-08-26 13:53:37,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036281020] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:37,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:37,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 13:53:37,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830368916] [2023-08-26 13:53:37,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:37,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 13:53:37,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:37,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 13:53:37,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 13:53:37,261 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 344 [2023-08-26 13:53:37,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 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) [2023-08-26 13:53:37,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:37,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 344 [2023-08-26 13:53:37,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:37,439 INFO L124 PetriNetUnfolderBase]: 1472/2425 cut-off events. [2023-08-26 13:53:37,440 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-26 13:53:37,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4926 conditions, 2425 events. 1472/2425 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 11849 event pairs, 1114 based on Foata normal form. 0/1583 useless extension candidates. Maximal degree in co-relation 4921. Up to 2203 conditions per place. [2023-08-26 13:53:37,454 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 35 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-26 13:53:37,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 42 transitions, 180 flow [2023-08-26 13:53:37,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:37,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:37,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 425 transitions. [2023-08-26 13:53:37,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4118217054263566 [2023-08-26 13:53:37,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 425 transitions. [2023-08-26 13:53:37,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 425 transitions. [2023-08-26 13:53:37,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:37,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 425 transitions. [2023-08-26 13:53:37,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 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) [2023-08-26 13:53:37,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,460 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 110 flow. Second operand 3 states and 425 transitions. [2023-08-26 13:53:37,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 42 transitions, 180 flow [2023-08-26 13:53:37,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:37,462 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 109 flow [2023-08-26 13:53:37,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-26 13:53:37,462 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 13:53:37,462 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 109 flow [2023-08-26 13:53:37,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 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) [2023-08-26 13:53:37,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:37,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 13:53:37,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 13:53:37,463 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:37,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 671382344, now seen corresponding path program 1 times [2023-08-26 13:53:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:37,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262904407] [2023-08-26 13:53:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262904407] [2023-08-26 13:53:37,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262904407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:37,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:37,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 13:53:37,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458937282] [2023-08-26 13:53:37,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:37,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 13:53:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:37,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 13:53:37,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 13:53:37,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 344 [2023-08-26 13:53:37,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 109 flow. Second operand has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 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) [2023-08-26 13:53:37,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:37,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 344 [2023-08-26 13:53:37,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:37,669 INFO L124 PetriNetUnfolderBase]: 939/1609 cut-off events. [2023-08-26 13:53:37,669 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-08-26 13:53:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3284 conditions, 1609 events. 939/1609 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 7549 event pairs, 693 based on Foata normal form. 0/1188 useless extension candidates. Maximal degree in co-relation 3279. Up to 1454 conditions per place. [2023-08-26 13:53:37,676 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 34 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-08-26 13:53:37,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 177 flow [2023-08-26 13:53:37,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-26 13:53:37,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40794573643410853 [2023-08-26 13:53:37,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-26 13:53:37,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-26 13:53:37,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:37,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-26 13:53:37,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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) [2023-08-26 13:53:37,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,682 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 109 flow. Second operand 3 states and 421 transitions. [2023-08-26 13:53:37,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 177 flow [2023-08-26 13:53:37,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:37,683 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 108 flow [2023-08-26 13:53:37,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-26 13:53:37,684 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-26 13:53:37,684 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 108 flow [2023-08-26 13:53:37,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 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) [2023-08-26 13:53:37,684 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:37,685 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 13:53:37,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 13:53:37,685 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:37,685 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:37,685 INFO L85 PathProgramCache]: Analyzing trace with hash -662839985, now seen corresponding path program 1 times [2023-08-26 13:53:37,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:37,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069328444] [2023-08-26 13:53:37,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:37,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:37,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:37,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069328444] [2023-08-26 13:53:37,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069328444] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:37,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:37,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 13:53:37,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697220523] [2023-08-26 13:53:37,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:37,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:37,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:37,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:37,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:37,771 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 344 [2023-08-26 13:53:37,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-08-26 13:53:37,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:37,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 344 [2023-08-26 13:53:37,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:37,914 INFO L124 PetriNetUnfolderBase]: 765/1333 cut-off events. [2023-08-26 13:53:37,914 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2023-08-26 13:53:37,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2737 conditions, 1333 events. 765/1333 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5965 event pairs, 247 based on Foata normal form. 0/1012 useless extension candidates. Maximal degree in co-relation 2732. Up to 793 conditions per place. [2023-08-26 13:53:37,919 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 53 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-26 13:53:37,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 259 flow [2023-08-26 13:53:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 486 transitions. [2023-08-26 13:53:37,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47093023255813954 [2023-08-26 13:53:37,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 486 transitions. [2023-08-26 13:53:37,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 486 transitions. [2023-08-26 13:53:37,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:37,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 486 transitions. [2023-08-26 13:53:37,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 162.0) internal successors, (486), 3 states have internal predecessors, (486), 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) [2023-08-26 13:53:37,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,925 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:37,925 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 108 flow. Second operand 3 states and 486 transitions. [2023-08-26 13:53:37,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 259 flow [2023-08-26 13:53:37,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:37,926 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 111 flow [2023-08-26 13:53:37,927 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 13:53:37,927 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-26 13:53:37,927 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 111 flow [2023-08-26 13:53:37,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 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) [2023-08-26 13:53:37,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:37,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:37,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 13:53:37,928 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:37,928 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:37,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1334678534, now seen corresponding path program 1 times [2023-08-26 13:53:37,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:37,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303460586] [2023-08-26 13:53:37,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:37,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:37,941 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:37,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739903322] [2023-08-26 13:53:37,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:37,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:37,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:37,949 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) [2023-08-26 13:53:37,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 13:53:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:38,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 13:53:38,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:38,097 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 13:53:38,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303460586] [2023-08-26 13:53:38,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739903322] [2023-08-26 13:53:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739903322] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:38,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 13:53:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835245627] [2023-08-26 13:53:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:38,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 13:53:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:38,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 13:53:38,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 13:53:38,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 344 [2023-08-26 13:53:38,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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) [2023-08-26 13:53:38,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:38,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 344 [2023-08-26 13:53:38,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:38,296 INFO L124 PetriNetUnfolderBase]: 847/1490 cut-off events. [2023-08-26 13:53:38,296 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-26 13:53:38,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3104 conditions, 1490 events. 847/1490 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 7210 event pairs, 293 based on Foata normal form. 0/1176 useless extension candidates. Maximal degree in co-relation 3098. Up to 657 conditions per place. [2023-08-26 13:53:38,302 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 61 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2023-08-26 13:53:38,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 327 flow [2023-08-26 13:53:38,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 13:53:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 13:53:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 624 transitions. [2023-08-26 13:53:38,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45348837209302323 [2023-08-26 13:53:38,305 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 624 transitions. [2023-08-26 13:53:38,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 624 transitions. [2023-08-26 13:53:38,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:38,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 624 transitions. [2023-08-26 13:53:38,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 156.0) internal successors, (624), 4 states have internal predecessors, (624), 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) [2023-08-26 13:53:38,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-08-26 13:53:38,309 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-08-26 13:53:38,309 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 111 flow. Second operand 4 states and 624 transitions. [2023-08-26 13:53:38,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 327 flow [2023-08-26 13:53:38,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 74 transitions, 323 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 13:53:38,311 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 141 flow [2023-08-26 13:53:38,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=141, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-08-26 13:53:38,312 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-26 13:53:38,312 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 141 flow [2023-08-26 13:53:38,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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) [2023-08-26 13:53:38,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:38,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:38,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:38,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:38,518 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:38,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:38,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1345657928, now seen corresponding path program 1 times [2023-08-26 13:53:38,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:38,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129385038] [2023-08-26 13:53:38,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:38,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:38,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:38,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:38,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129385038] [2023-08-26 13:53:38,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129385038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:38,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:38,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 13:53:38,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089724334] [2023-08-26 13:53:38,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:38,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:38,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:38,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:38,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:38,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 344 [2023-08-26 13:53:38,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-08-26 13:53:38,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:38,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 344 [2023-08-26 13:53:38,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:38,784 INFO L124 PetriNetUnfolderBase]: 1040/1768 cut-off events. [2023-08-26 13:53:38,784 INFO L125 PetriNetUnfolderBase]: For 815/815 co-relation queries the response was YES. [2023-08-26 13:53:38,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 1768 events. 1040/1768 cut-off events. For 815/815 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7933 event pairs, 445 based on Foata normal form. 0/1479 useless extension candidates. Maximal degree in co-relation 4228. Up to 1048 conditions per place. [2023-08-26 13:53:38,791 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 57 selfloop transitions, 3 changer transitions 3/67 dead transitions. [2023-08-26 13:53:38,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 67 transitions, 354 flow [2023-08-26 13:53:38,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:38,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-08-26 13:53:38,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49612403100775193 [2023-08-26 13:53:38,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-08-26 13:53:38,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-08-26 13:53:38,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:38,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-08-26 13:53:38,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 13:53:38,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:38,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:38,797 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 141 flow. Second operand 3 states and 512 transitions. [2023-08-26 13:53:38,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 67 transitions, 354 flow [2023-08-26 13:53:38,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 346 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:38,799 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 152 flow [2023-08-26 13:53:38,800 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-26 13:53:38,801 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 3 predicate places. [2023-08-26 13:53:38,801 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 152 flow [2023-08-26 13:53:38,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 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) [2023-08-26 13:53:38,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:38,802 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:38,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 13:53:38,802 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:38,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:38,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1393609373, now seen corresponding path program 1 times [2023-08-26 13:53:38,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:38,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380293962] [2023-08-26 13:53:38,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:38,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:38,820 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:38,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1333240240] [2023-08-26 13:53:38,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:38,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:38,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:38,822 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) [2023-08-26 13:53:38,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 13:53:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:38,923 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 13:53:38,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:38,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:38,943 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 13:53:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:38,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:38,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380293962] [2023-08-26 13:53:38,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:38,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333240240] [2023-08-26 13:53:38,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333240240] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-26 13:53:38,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-26 13:53:38,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2023-08-26 13:53:38,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828601466] [2023-08-26 13:53:38,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:38,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:38,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:38,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 13:53:38,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 344 [2023-08-26 13:53:38,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-08-26 13:53:38,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:38,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 344 [2023-08-26 13:53:38,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:39,101 INFO L124 PetriNetUnfolderBase]: 648/1175 cut-off events. [2023-08-26 13:53:39,101 INFO L125 PetriNetUnfolderBase]: For 396/396 co-relation queries the response was YES. [2023-08-26 13:53:39,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2627 conditions, 1175 events. 648/1175 cut-off events. For 396/396 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5050 event pairs, 273 based on Foata normal form. 118/1102 useless extension candidates. Maximal degree in co-relation 2618. Up to 637 conditions per place. [2023-08-26 13:53:39,105 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 45 selfloop transitions, 3 changer transitions 4/56 dead transitions. [2023-08-26 13:53:39,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 56 transitions, 287 flow [2023-08-26 13:53:39,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:39,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:39,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2023-08-26 13:53:39,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2023-08-26 13:53:39,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2023-08-26 13:53:39,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2023-08-26 13:53:39,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:39,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2023-08-26 13:53:39,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 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) [2023-08-26 13:53:39,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:39,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:39,111 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 152 flow. Second operand 3 states and 504 transitions. [2023-08-26 13:53:39,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 56 transitions, 287 flow [2023-08-26 13:53:39,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 277 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 13:53:39,114 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 158 flow [2023-08-26 13:53:39,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-26 13:53:39,115 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2023-08-26 13:53:39,115 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 158 flow [2023-08-26 13:53:39,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2023-08-26 13:53:39,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:39,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:39,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:39,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-26 13:53:39,324 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:39,325 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1612164136, now seen corresponding path program 1 times [2023-08-26 13:53:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:39,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164090302] [2023-08-26 13:53:39,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:39,340 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1801303604] [2023-08-26 13:53:39,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:39,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:39,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:39,342 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) [2023-08-26 13:53:39,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 13:53:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:39,449 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 13:53:39,451 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:39,481 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-26 13:53:39,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:39,500 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 13:53:39,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:39,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164090302] [2023-08-26 13:53:39,500 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:39,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801303604] [2023-08-26 13:53:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801303604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:39,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 13:53:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679816823] [2023-08-26 13:53:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:39,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:39,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:39,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:39,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 344 [2023-08-26 13:53:39,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-26 13:53:39,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:39,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 344 [2023-08-26 13:53:39,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:39,632 INFO L124 PetriNetUnfolderBase]: 588/1089 cut-off events. [2023-08-26 13:53:39,632 INFO L125 PetriNetUnfolderBase]: For 218/218 co-relation queries the response was YES. [2023-08-26 13:53:39,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2529 conditions, 1089 events. 588/1089 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4781 event pairs, 184 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 2519. Up to 602 conditions per place. [2023-08-26 13:53:39,636 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 45 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2023-08-26 13:53:39,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 54 transitions, 289 flow [2023-08-26 13:53:39,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:39,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:39,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-08-26 13:53:39,639 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46124031007751937 [2023-08-26 13:53:39,639 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-08-26 13:53:39,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-08-26 13:53:39,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:39,639 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-08-26 13:53:39,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 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) [2023-08-26 13:53:39,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:39,642 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:39,642 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 158 flow. Second operand 3 states and 476 transitions. [2023-08-26 13:53:39,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 54 transitions, 289 flow [2023-08-26 13:53:39,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 54 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 13:53:39,646 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 156 flow [2023-08-26 13:53:39,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-26 13:53:39,647 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-26 13:53:39,647 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 156 flow [2023-08-26 13:53:39,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 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) [2023-08-26 13:53:39,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:39,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:39,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:39,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:39,854 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:39,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash 81236526, now seen corresponding path program 1 times [2023-08-26 13:53:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:39,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373944040] [2023-08-26 13:53:39,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:39,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:39,874 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:39,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306036718] [2023-08-26 13:53:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:39,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:39,875 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) [2023-08-26 13:53:39,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 13:53:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:40,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-26 13:53:40,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:40,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:40,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:40,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:40,079 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 13:53:40,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:40,209 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 13:53:40,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373944040] [2023-08-26 13:53:40,210 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:40,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306036718] [2023-08-26 13:53:40,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306036718] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:40,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:40,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 13:53:40,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244855960] [2023-08-26 13:53:40,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:40,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 13:53:40,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:40,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 13:53:40,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 13:53:40,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 344 [2023-08-26 13:53:40,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-26 13:53:40,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:40,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 344 [2023-08-26 13:53:40,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:40,363 INFO L124 PetriNetUnfolderBase]: 647/1250 cut-off events. [2023-08-26 13:53:40,363 INFO L125 PetriNetUnfolderBase]: For 432/436 co-relation queries the response was YES. [2023-08-26 13:53:40,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2999 conditions, 1250 events. 647/1250 cut-off events. For 432/436 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5385 event pairs, 360 based on Foata normal form. 0/1183 useless extension candidates. Maximal degree in co-relation 2989. Up to 633 conditions per place. [2023-08-26 13:53:40,369 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 60 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-08-26 13:53:40,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 68 transitions, 380 flow [2023-08-26 13:53:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 13:53:40,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 13:53:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2023-08-26 13:53:40,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4312015503875969 [2023-08-26 13:53:40,371 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 445 transitions. [2023-08-26 13:53:40,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 445 transitions. [2023-08-26 13:53:40,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:40,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 445 transitions. [2023-08-26 13:53:40,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 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) [2023-08-26 13:53:40,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:40,374 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 344.0) internal successors, (1376), 4 states have internal predecessors, (1376), 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) [2023-08-26 13:53:40,374 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 156 flow. Second operand 3 states and 445 transitions. [2023-08-26 13:53:40,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 68 transitions, 380 flow [2023-08-26 13:53:40,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:40,377 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 164 flow [2023-08-26 13:53:40,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-26 13:53:40,379 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-26 13:53:40,379 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 164 flow [2023-08-26 13:53:40,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 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) [2023-08-26 13:53:40,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:40,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:40,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:40,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:40,586 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:40,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:40,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1246773146, now seen corresponding path program 1 times [2023-08-26 13:53:40,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:40,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289218529] [2023-08-26 13:53:40,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:40,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:40,601 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:40,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885476115] [2023-08-26 13:53:40,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:40,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:40,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:40,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 13:53:40,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 13:53:41,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:41,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-26 13:53:41,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:41,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:41,161 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 13:53:41,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289218529] [2023-08-26 13:53:41,162 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:41,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885476115] [2023-08-26 13:53:41,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885476115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:41,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:41,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 13:53:41,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346874517] [2023-08-26 13:53:41,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:41,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 13:53:41,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:41,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 13:53:41,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 13:53:41,163 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 344 [2023-08-26 13:53:41,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 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) [2023-08-26 13:53:41,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:41,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 344 [2023-08-26 13:53:41,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:41,320 INFO L124 PetriNetUnfolderBase]: 488/963 cut-off events. [2023-08-26 13:53:41,320 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2023-08-26 13:53:41,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2276 conditions, 963 events. 488/963 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3773 event pairs, 161 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 2264. Up to 454 conditions per place. [2023-08-26 13:53:41,325 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 55 selfloop transitions, 3 changer transitions 5/69 dead transitions. [2023-08-26 13:53:41,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 368 flow [2023-08-26 13:53:41,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 13:53:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 13:53:41,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 613 transitions. [2023-08-26 13:53:41,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44549418604651164 [2023-08-26 13:53:41,327 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 613 transitions. [2023-08-26 13:53:41,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 613 transitions. [2023-08-26 13:53:41,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:41,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 613 transitions. [2023-08-26 13:53:41,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 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) [2023-08-26 13:53:41,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-08-26 13:53:41,331 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-08-26 13:53:41,331 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 164 flow. Second operand 4 states and 613 transitions. [2023-08-26 13:53:41,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 368 flow [2023-08-26 13:53:41,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 69 transitions, 366 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 13:53:41,334 INFO L231 Difference]: Finished difference. Result has 59 places, 42 transitions, 172 flow [2023-08-26 13:53:41,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=172, PETRI_PLACES=59, PETRI_TRANSITIONS=42} [2023-08-26 13:53:41,334 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2023-08-26 13:53:41,334 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 42 transitions, 172 flow [2023-08-26 13:53:41,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 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) [2023-08-26 13:53:41,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:41,335 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:41,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:41,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-26 13:53:41,541 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:41,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:41,542 INFO L85 PathProgramCache]: Analyzing trace with hash -4811213, now seen corresponding path program 1 times [2023-08-26 13:53:41,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:41,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938928082] [2023-08-26 13:53:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:41,558 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:41,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [289776561] [2023-08-26 13:53:41,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:41,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:41,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:41,559 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 13:53:41,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 13:53:41,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:41,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-26 13:53:41,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:41,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:41,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2023-08-26 13:53:41,904 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 13:53:41,905 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 13:53:41,940 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 13:53:41,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 44 [2023-08-26 13:53:42,094 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2023-08-26 13:53:42,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:42,165 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-26 13:53:42,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938928082] [2023-08-26 13:53:42,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [289776561] [2023-08-26 13:53:42,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [289776561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 13:53:42,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 13:53:42,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 13:53:42,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668766178] [2023-08-26 13:53:42,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 13:53:42,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 13:53:42,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:42,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 13:53:42,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-26 13:53:42,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 344 [2023-08-26 13:53:42,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 42 transitions, 172 flow. Second operand has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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) [2023-08-26 13:53:42,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:42,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 344 [2023-08-26 13:53:42,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:42,583 INFO L124 PetriNetUnfolderBase]: 821/1596 cut-off events. [2023-08-26 13:53:42,583 INFO L125 PetriNetUnfolderBase]: For 545/549 co-relation queries the response was YES. [2023-08-26 13:53:42,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3802 conditions, 1596 events. 821/1596 cut-off events. For 545/549 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 7074 event pairs, 305 based on Foata normal form. 12/1568 useless extension candidates. Maximal degree in co-relation 3789. Up to 456 conditions per place. [2023-08-26 13:53:42,590 INFO L140 encePairwiseOnDemand]: 334/344 looper letters, 94 selfloop transitions, 12 changer transitions 6/118 dead transitions. [2023-08-26 13:53:42,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 118 transitions, 646 flow [2023-08-26 13:53:42,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 13:53:42,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 13:53:42,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 968 transitions. [2023-08-26 13:53:42,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35174418604651164 [2023-08-26 13:53:42,593 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 968 transitions. [2023-08-26 13:53:42,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 968 transitions. [2023-08-26 13:53:42,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:42,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 968 transitions. [2023-08-26 13:53:42,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.0) internal successors, (968), 8 states have internal predecessors, (968), 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) [2023-08-26 13:53:42,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 344.0) internal successors, (3096), 9 states have internal predecessors, (3096), 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) [2023-08-26 13:53:42,600 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 344.0) internal successors, (3096), 9 states have internal predecessors, (3096), 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) [2023-08-26 13:53:42,600 INFO L175 Difference]: Start difference. First operand has 59 places, 42 transitions, 172 flow. Second operand 8 states and 968 transitions. [2023-08-26 13:53:42,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 118 transitions, 646 flow [2023-08-26 13:53:42,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 118 transitions, 638 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 13:53:42,604 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 266 flow [2023-08-26 13:53:42,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=266, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2023-08-26 13:53:42,605 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 19 predicate places. [2023-08-26 13:53:42,605 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 266 flow [2023-08-26 13:53:42,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 109.0) internal successors, (872), 8 states have internal predecessors, (872), 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) [2023-08-26 13:53:42,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:42,606 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:42,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:42,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 13:53:42,812 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:42,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1472832504, now seen corresponding path program 1 times [2023-08-26 13:53:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37672261] [2023-08-26 13:53:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:42,828 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:42,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [46955495] [2023-08-26 13:53:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:42,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:42,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:42,829 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 13:53:42,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 13:53:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:43,028 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 13:53:43,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:43,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:43,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:43,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:43,049 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 13:53:43,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:43,241 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 13:53:43,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:43,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:43,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37672261] [2023-08-26 13:53:43,871 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:43,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46955495] [2023-08-26 13:53:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46955495] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 13:53:43,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-26 13:53:43,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-08-26 13:53:43,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971326923] [2023-08-26 13:53:43,871 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-26 13:53:43,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 13:53:43,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:43,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 13:53:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 13:53:43,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 344 [2023-08-26 13:53:43,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 266 flow. Second operand has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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) [2023-08-26 13:53:43,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:43,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 344 [2023-08-26 13:53:43,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:44,083 INFO L124 PetriNetUnfolderBase]: 623/1222 cut-off events. [2023-08-26 13:53:44,084 INFO L125 PetriNetUnfolderBase]: For 1211/1217 co-relation queries the response was YES. [2023-08-26 13:53:44,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 1222 events. 623/1222 cut-off events. For 1211/1217 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4961 event pairs, 306 based on Foata normal form. 58/1274 useless extension candidates. Maximal degree in co-relation 3248. Up to 651 conditions per place. [2023-08-26 13:53:44,090 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 49 selfloop transitions, 3 changer transitions 2/60 dead transitions. [2023-08-26 13:53:44,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 405 flow [2023-08-26 13:53:44,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 13:53:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 13:53:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-26 13:53:44,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39316860465116277 [2023-08-26 13:53:44,092 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-26 13:53:44,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-26 13:53:44,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:44,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-26 13:53:44,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 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) [2023-08-26 13:53:44,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-08-26 13:53:44,097 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 344.0) internal successors, (1720), 5 states have internal predecessors, (1720), 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) [2023-08-26 13:53:44,097 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 266 flow. Second operand 4 states and 541 transitions. [2023-08-26 13:53:44,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 405 flow [2023-08-26 13:53:44,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 387 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-26 13:53:44,101 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 219 flow [2023-08-26 13:53:44,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-08-26 13:53:44,102 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-26 13:53:44,102 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 219 flow [2023-08-26 13:53:44,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 128.0) internal successors, (1024), 8 states have internal predecessors, (1024), 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) [2023-08-26 13:53:44,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:44,103 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:44,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:44,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:44,309 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:44,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:44,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1003607629, now seen corresponding path program 1 times [2023-08-26 13:53:44,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:44,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075793890] [2023-08-26 13:53:44,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:44,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:44,327 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:44,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145777114] [2023-08-26 13:53:44,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:44,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:44,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:44,328 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 13:53:44,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 13:53:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:44,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-26 13:53:44,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:44,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:44,903 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 13:53:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:45,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 13:53:45,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075793890] [2023-08-26 13:53:45,569 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 13:53:45,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145777114] [2023-08-26 13:53:45,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145777114] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 13:53:45,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-26 13:53:45,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-26 13:53:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636988617] [2023-08-26 13:53:45,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-26 13:53:45,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-26 13:53:45,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 13:53:45,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-26 13:53:45,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-08-26 13:53:45,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 344 [2023-08-26 13:53:45,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 219 flow. Second operand has 12 states, 12 states have (on average 140.58333333333334) internal successors, (1687), 12 states have internal predecessors, (1687), 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) [2023-08-26 13:53:45,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 13:53:45,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 344 [2023-08-26 13:53:45,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 13:53:46,937 INFO L124 PetriNetUnfolderBase]: 738/1503 cut-off events. [2023-08-26 13:53:46,938 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2023-08-26 13:53:46,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3946 conditions, 1503 events. 738/1503 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5298 event pairs, 160 based on Foata normal form. 20/1523 useless extension candidates. Maximal degree in co-relation 3929. Up to 419 conditions per place. [2023-08-26 13:53:46,947 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 105 selfloop transitions, 11 changer transitions 7/129 dead transitions. [2023-08-26 13:53:46,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 129 transitions, 790 flow [2023-08-26 13:53:46,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 13:53:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 13:53:46,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1473 transitions. [2023-08-26 13:53:46,951 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4281976744186046 [2023-08-26 13:53:46,951 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1473 transitions. [2023-08-26 13:53:46,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1473 transitions. [2023-08-26 13:53:46,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 13:53:46,952 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1473 transitions. [2023-08-26 13:53:46,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 147.3) internal successors, (1473), 10 states have internal predecessors, (1473), 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) [2023-08-26 13:53:46,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 344.0) internal successors, (3784), 11 states have internal predecessors, (3784), 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) [2023-08-26 13:53:46,960 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 344.0) internal successors, (3784), 11 states have internal predecessors, (3784), 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) [2023-08-26 13:53:46,960 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 219 flow. Second operand 10 states and 1473 transitions. [2023-08-26 13:53:46,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 129 transitions, 790 flow [2023-08-26 13:53:46,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 129 transitions, 775 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-26 13:53:46,965 INFO L231 Difference]: Finished difference. Result has 71 places, 49 transitions, 276 flow [2023-08-26 13:53:46,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=276, PETRI_PLACES=71, PETRI_TRANSITIONS=49} [2023-08-26 13:53:46,966 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2023-08-26 13:53:46,966 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 49 transitions, 276 flow [2023-08-26 13:53:46,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 140.58333333333334) internal successors, (1687), 12 states have internal predecessors, (1687), 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) [2023-08-26 13:53:46,979 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 13:53:46,979 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 13:53:46,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 13:53:47,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-26 13:53:47,180 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err2ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 21 more)] === [2023-08-26 13:53:47,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 13:53:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2005504330, now seen corresponding path program 1 times [2023-08-26 13:53:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 13:53:47,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796203251] [2023-08-26 13:53:47,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:47,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 13:53:47,196 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-08-26 13:53:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1760596546] [2023-08-26 13:53:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 13:53:47,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 13:53:47,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 13:53:47,197 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 13:53:47,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 13:53:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 13:53:47,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-26 13:53:47,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 13:53:47,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:47,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:47,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:47,501 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-26 13:53:47,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 13:53:47,507 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 12 [2023-08-26 13:53:47,521 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-26 13:53:47,521 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-08-26 13:53:47,604 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 13:53:47,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 13:53:49,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 65 [2023-08-26 13:53:49,963 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2023-08-26 13:53:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 13:53:50,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 13:54:24,230 WARN L234 SmtUtils]: Spent 23.77s on a formula simplification that was a NOOP. DAG size: 119 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 13:54:53,881 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#length| |c_~#buffer~0.base|)) (.cse4 (mod (+ c_~first~0 1) 4294967296)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse8 (< 2147483647 .cse7)) (.cse6 (+ .cse7 |c_~#buffer~0.offset|)) (.cse2 (<= .cse4 2147483647)) (.cse0 (+ .cse3 4294967295)) (.cse5 (<= .cse7 2147483647)) (.cse22 (< 2147483647 .cse4)) (.cse1 (+ |c_~#buffer~0.offset| .cse4))) (or (and (or (< .cse0 .cse1) .cse2) (< .cse3 (+ |c_~#buffer~0.offset| .cse4 1))) (and (or .cse5 (< .cse0 .cse6)) (< .cse3 (+ .cse7 |c_~#buffer~0.offset| 1))) (and (< .cse6 4294967296) (or .cse8 (< .cse6 0))) (let ((.cse13 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1))) (let ((.cse39 (mod .cse13 256)) (.cse87 (mod c_~first~0 4294967296))) (let ((.cse21 (+ |c_~#buffer~0.offset| .cse87 (- 4294967296))) (.cse18 (<= .cse87 2147483647)) (.cse17 (< 2147483647 .cse87)) (.cse9 (<= .cse39 127)) (.cse12 (+ (- 256) .cse39)) (.cse36 (< 127 .cse39)) (.cse14 (+ |c_~#buffer~0.offset| .cse87)) (.cse29 (+ |c_~#buffer~0.offset| .cse4 (- 4294967296))) (.cse15 (mod (+ c_~next~0 1) 4294967296)) (.cse16 (select |c_#memory_int| |c_~#buffer~0.base|))) (and (or .cse8 (and (or .cse9 (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse10 (store .cse16 .cse6 v_ArrVal_819)) (.cse11 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse10 (+ |c_~#buffer~0.offset| (- 4294967296) .cse11) .cse12) .cse1) .cse13) (not (= (select .cse10 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse11 2147483647) (<= v_z_29 .cse11)))) .cse17) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse19 (store .cse16 .cse6 v_ArrVal_819)) (.cse20 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse19 (+ |c_~#buffer~0.offset| (- 4294967296) .cse20) .cse12) .cse1) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse19 .cse21))) (<= .cse20 2147483647) (<= v_z_29 .cse20)))))) .cse22) (or (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse23 (store .cse16 .cse6 v_ArrVal_819)) (.cse24 (mod (mod .cse15 v_z_29) 4294967296))) (or (= (select (store .cse23 (+ |c_~#buffer~0.offset| .cse24) .cse12) .cse1) .cse13) (<= 4294967296 v_z_29) (not (= (select .cse23 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse24 0) (<= v_z_29 .cse4) (< 2147483647 .cse24) (< .cse3 (+ |c_~#buffer~0.offset| .cse24 1)))))) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse25 (store .cse16 .cse6 v_ArrVal_819)) (.cse26 (mod (mod .cse15 v_z_29) 4294967296))) (or (= (select (store .cse25 (+ |c_~#buffer~0.offset| .cse26) .cse12) .cse1) .cse13) (<= 4294967296 v_z_29) (<= .cse26 0) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse25 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse26) (< .cse3 (+ |c_~#buffer~0.offset| .cse26 1))))))) .cse22) (or (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse27 (store .cse16 .cse6 v_ArrVal_819)) (.cse28 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse27 (+ |c_~#buffer~0.offset| (- 4294967296) .cse28) .cse12) .cse29) .cse13) (not (= (select .cse27 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse4) (<= .cse28 2147483647))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse30 (store .cse16 .cse6 v_ArrVal_819)) (.cse31 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse30 (+ |c_~#buffer~0.offset| (- 4294967296) .cse31) .cse12) .cse29) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse30 .cse21))) (<= v_z_29 .cse4) (<= .cse31 2147483647)))) .cse18)) .cse2) (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse32 (store .cse16 .cse6 v_ArrVal_819)) (.cse33 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse32 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse33) (= (select (store .cse32 (+ |c_~#buffer~0.offset| .cse33) .cse12) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse33 1))))) .cse18) (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse34 (store .cse16 .cse6 v_ArrVal_819)) (.cse35 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse34 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse4) (< 2147483647 .cse35) (= (select (store .cse34 (+ |c_~#buffer~0.offset| .cse35) .cse12) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse35 1))))))) .cse2))) (or .cse36 (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse37 (store .cse16 .cse6 v_ArrVal_819)) (.cse38 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse13 (select (store .cse37 (+ |c_~#buffer~0.offset| (- 4294967296) .cse38) .cse39) .cse1)) (not (= (select .cse37 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse38 2147483647) (<= v_z_29 .cse38)))) .cse17) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse40 (store .cse16 .cse6 v_ArrVal_819)) (.cse41 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse13 (select (store .cse40 (+ |c_~#buffer~0.offset| (- 4294967296) .cse41) .cse39) .cse1)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse40 .cse21))) (<= .cse41 2147483647) (<= v_z_29 .cse41)))))) .cse22) (or .cse2 (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse42 (store .cse16 .cse6 v_ArrVal_819)) (.cse43 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse42 (+ |c_~#buffer~0.offset| (- 4294967296) .cse43) .cse39) .cse29) .cse13) (not (= (select .cse42 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse4) (<= .cse43 2147483647))))) (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse44 (store .cse16 .cse6 v_ArrVal_819)) (.cse45 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse44 (+ |c_~#buffer~0.offset| (- 4294967296) .cse45) .cse39) .cse29) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse44 .cse21))) (<= v_z_29 .cse4) (<= .cse45 2147483647))))))) (or (and (or .cse18 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse47 (store .cse16 .cse6 v_ArrVal_819)) (.cse46 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse46 0) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse47 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse46) (= .cse13 (select (store .cse47 (+ |c_~#buffer~0.offset| .cse46) .cse39) .cse1)) (< .cse3 (+ |c_~#buffer~0.offset| .cse46 1)))))) (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse48 (store .cse16 .cse6 v_ArrVal_819)) (.cse49 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse48 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse49 0) (<= v_z_29 .cse4) (< 2147483647 .cse49) (= .cse13 (select (store .cse48 (+ |c_~#buffer~0.offset| .cse49) .cse39) .cse1)) (< .cse3 (+ |c_~#buffer~0.offset| .cse49 1))))))) .cse22) (or (and (or .cse17 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse50 (store .cse16 .cse6 v_ArrVal_819)) (.cse51 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse50 .cse14) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse13 (select (store .cse50 (+ |c_~#buffer~0.offset| .cse51) .cse39) .cse29)) (<= v_z_29 .cse4) (< 2147483647 .cse51) (< .cse3 (+ |c_~#buffer~0.offset| .cse51 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse52 (store .cse16 .cse6 v_ArrVal_819)) (.cse53 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse13 (select (store .cse52 (+ |c_~#buffer~0.offset| .cse53) .cse39) .cse29)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse52 .cse21))) (<= v_z_29 .cse4) (< 2147483647 .cse53) (< .cse3 (+ |c_~#buffer~0.offset| .cse53 1))))) .cse18)) .cse2))))) (or (let ((.cse56 (+ .cse7 |c_~#buffer~0.offset| (- 4294967296)))) (and (or (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse54 (store .cse16 .cse56 v_ArrVal_819)) (.cse55 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse54 .cse21))) (<= .cse55 0) (<= v_z_29 .cse4) (< 2147483647 .cse55) (= (select (store .cse54 (+ |c_~#buffer~0.offset| .cse55) .cse39) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse55 1))))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse57 (store .cse16 .cse56 v_ArrVal_819)) (.cse58 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse57 (+ |c_~#buffer~0.offset| (- 4294967296) .cse58) .cse39) .cse1) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse57 .cse21))) (<= .cse58 2147483647) (<= v_z_29 .cse58)))) .cse22) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse60 (store .cse16 .cse56 v_ArrVal_819)) (.cse59 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse59)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse60 .cse21))) (<= v_z_29 .cse4) (<= .cse59 2147483647) (= (select (store .cse60 (+ |c_~#buffer~0.offset| (- 4294967296) .cse59) .cse39) .cse29) .cse13)))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse61 (store .cse16 .cse56 v_ArrVal_819)) (.cse62 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse61 .cse21))) (<= .cse62 0) (= .cse13 (select (store .cse61 (+ |c_~#buffer~0.offset| .cse62) .cse39) .cse1)) (<= v_z_29 .cse4) (< 2147483647 .cse62) (< .cse3 (+ |c_~#buffer~0.offset| .cse62 1))))) .cse22)) .cse36) (or .cse9 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse64 (store .cse16 .cse56 v_ArrVal_819)) (.cse63 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse63)) (= .cse13 (select (store .cse64 (+ |c_~#buffer~0.offset| (- 4294967296) .cse63) .cse12) .cse29)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse64 .cse21))) (<= v_z_29 .cse4) (<= .cse63 2147483647)))) .cse2) (or .cse22 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse65 (store .cse16 .cse56 v_ArrVal_819)) (.cse66 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse65 .cse21))) (<= .cse66 0) (= (select (store .cse65 (+ |c_~#buffer~0.offset| .cse66) .cse12) .cse1) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse66) (< .cse3 (+ |c_~#buffer~0.offset| .cse66 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse67 (store .cse16 .cse56 v_ArrVal_819)) (.cse68 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse67 .cse21))) (= (select (store .cse67 (+ |c_~#buffer~0.offset| (- 4294967296) .cse68) .cse12) .cse1) .cse13) (<= .cse68 2147483647) (<= v_z_29 .cse68)))) .cse22) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse69 (store .cse16 .cse56 v_ArrVal_819)) (.cse70 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse69 .cse21))) (<= .cse70 0) (= (select (store .cse69 (+ |c_~#buffer~0.offset| .cse70) .cse12) .cse29) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse70) (< .cse3 (+ |c_~#buffer~0.offset| .cse70 1))))))))) .cse18) (or .cse17 (and (or .cse9 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse71 (store .cse16 .cse56 v_ArrVal_819)) (.cse72 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse71 .cse14))) (<= .cse72 0) (= (select (store .cse71 (+ |c_~#buffer~0.offset| .cse72) .cse12) .cse1) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse72) (< .cse3 (+ |c_~#buffer~0.offset| .cse72 1))))) .cse22) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse73 (store .cse16 .cse56 v_ArrVal_819)) (.cse74 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse73 .cse14))) (<= .cse74 0) (= (select (store .cse73 (+ |c_~#buffer~0.offset| .cse74) .cse12) .cse29) .cse13) (<= v_z_29 .cse4) (< 2147483647 .cse74) (< .cse3 (+ |c_~#buffer~0.offset| .cse74 1))))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse75 (store .cse16 .cse56 v_ArrVal_819)) (.cse76 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse75 .cse14))) (= (select (store .cse75 (+ |c_~#buffer~0.offset| (- 4294967296) .cse76) .cse12) .cse1) .cse13) (<= .cse76 2147483647) (<= v_z_29 .cse76)))) .cse22) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse78 (store .cse16 .cse56 v_ArrVal_819)) (.cse77 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse77)) (= .cse13 (select (store .cse78 (+ |c_~#buffer~0.offset| (- 4294967296) .cse77) .cse12) .cse29)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse78 .cse14))) (<= v_z_29 .cse4) (<= .cse77 2147483647))))))) (or .cse36 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse79 (store .cse16 .cse56 v_ArrVal_819)) (.cse80 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse79 (+ |c_~#buffer~0.offset| (- 4294967296) .cse80) .cse39) .cse1) .cse13) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse79 .cse14))) (<= .cse80 2147483647) (<= v_z_29 .cse80)))) .cse22) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse81 (store .cse16 .cse56 v_ArrVal_819)) (.cse82 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse81 .cse14))) (<= .cse82 0) (<= v_z_29 .cse4) (< 2147483647 .cse82) (= (select (store .cse81 (+ |c_~#buffer~0.offset| .cse82) .cse39) .cse29) .cse13) (< .cse3 (+ |c_~#buffer~0.offset| .cse82 1)))))) (or .cse22 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse83 (store .cse16 .cse56 v_ArrVal_819)) (.cse84 (mod (mod .cse15 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse83 .cse14))) (<= .cse84 0) (= .cse13 (select (store .cse83 (+ |c_~#buffer~0.offset| .cse84) .cse39) .cse1)) (<= v_z_29 .cse4) (< 2147483647 .cse84) (< .cse3 (+ |c_~#buffer~0.offset| .cse84 1)))))) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse86 (store .cse16 .cse56 v_ArrVal_819)) (.cse85 (mod (mod .cse15 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse85)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse86 .cse14))) (<= v_z_29 .cse4) (<= .cse85 2147483647) (= (select (store .cse86 (+ |c_~#buffer~0.offset| (- 4294967296) .cse85) .cse39) .cse29) .cse13))))))))))) .cse5))))) (and (or (< .cse1 0) .cse22) (< .cse1 4294967296))))) is different from true [2023-08-26 13:59:08,178 WARN L234 SmtUtils]: Spent 3.35m on a formula simplification. DAG size of input: 266 DAG size of output: 256 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:00:06,487 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_~first~0 1) 4294967296)) (.cse3 (select |c_#length| |c_~#buffer~0.base|)) (.cse7 (mod c_~next~0 4294967296))) (let ((.cse8 (< 2147483647 .cse7)) (.cse6 (+ .cse7 |c_~#buffer~0.offset|)) (.cse5 (<= .cse7 2147483647)) (.cse0 (+ .cse3 4294967295)) (.cse2 (<= .cse4 2147483647)) (.cse26 (< 2147483647 .cse4)) (.cse1 (+ |c_~#buffer~0.offset| .cse4))) (or (and (or (< .cse0 .cse1) .cse2) (< .cse3 (+ |c_~#buffer~0.offset| .cse4 1))) (= (mod c_~send~0 256) 0) (and (or .cse5 (< .cse0 .cse6)) (< .cse3 (+ .cse7 |c_~#buffer~0.offset| 1))) (and (< .cse6 4294967296) (or .cse8 (< .cse6 0))) (let ((.cse15 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1))) (let ((.cse35 (mod .cse15 256)) (.cse82 (mod c_~first~0 4294967296))) (let ((.cse20 (+ |c_~#buffer~0.offset| .cse82 (- 4294967296))) (.cse21 (<= .cse82 2147483647)) (.cse10 (< 2147483647 .cse82)) (.cse9 (<= .cse35 127)) (.cse13 (+ (- 256) .cse35)) (.cse14 (+ |c_~#buffer~0.offset| .cse4 (- 4294967296))) (.cse16 (+ |c_~#buffer~0.offset| .cse82)) (.cse17 (mod (+ c_~next~0 1) 4294967296)) (.cse48 (< 127 .cse35))) (and (or .cse8 (and (or .cse9 (and (or (and (or .cse10 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse11 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse12 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse11 (+ |c_~#buffer~0.offset| (- 4294967296) .cse12) .cse13) .cse14) .cse15) (<= v_z_29 .cse4) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse11 .cse16))) (<= .cse12 2147483647))))) (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse19 (mod (mod .cse17 v_z_29) 4294967296)) (.cse18 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (= (select (store .cse18 (+ |c_~#buffer~0.offset| (- 4294967296) .cse19) .cse13) .cse14) .cse15) (<= v_z_29 .cse4) (<= .cse19 2147483647) (not (= (select .cse18 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)))))) .cse2) (or (and (or .cse21 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse23 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse22 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse22 0) (<= v_z_29 .cse4) (not (= (select .cse23 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse15 (select (store .cse23 (+ |c_~#buffer~0.offset| .cse22) .cse13) .cse1)) (< 2147483647 .cse22) (< .cse3 (+ |c_~#buffer~0.offset| .cse22 1)))))) (or .cse10 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse25 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse24 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse24 0) (<= v_z_29 .cse4) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse25 .cse16))) (= .cse15 (select (store .cse25 (+ |c_~#buffer~0.offset| .cse24) .cse13) .cse1)) (< 2147483647 .cse24) (< .cse3 (+ |c_~#buffer~0.offset| .cse24 1))))))) .cse26) (or .cse2 (and (or .cse21 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse27 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse28 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse27 (+ |c_~#buffer~0.offset| .cse28) .cse13) .cse14) .cse15) (<= v_z_29 .cse4) (not (= (select .cse27 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (< 2147483647 .cse28) (< .cse3 (+ |c_~#buffer~0.offset| .cse28 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse29 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse30 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse29 (+ |c_~#buffer~0.offset| .cse30) .cse13) .cse14) .cse15) (<= v_z_29 .cse4) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse29 .cse16))) (< 2147483647 .cse30) (< .cse3 (+ |c_~#buffer~0.offset| .cse30 1))))) .cse10))) (or .cse10 .cse26 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse31 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse32 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse31 (+ |c_~#buffer~0.offset| (- 4294967296) .cse32) .cse13) .cse1) .cse15) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse31 .cse16))) (<= .cse32 2147483647) (<= v_z_29 .cse32))))))) (or (and (or (and (or .cse10 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse33 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse34 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse33 (+ |c_~#buffer~0.offset| (- 4294967296) .cse34) .cse35) .cse14) .cse15) (<= v_z_29 .cse4) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse33 .cse16))) (<= .cse34 2147483647))))) (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse37 (mod (mod .cse17 v_z_29) 4294967296)) (.cse36 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (= (select (store .cse36 (+ |c_~#buffer~0.offset| (- 4294967296) .cse37) .cse35) .cse14) .cse15) (<= v_z_29 .cse4) (<= .cse37 2147483647) (not (= (select .cse36 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)))))) .cse2) (or .cse26 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse39 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse38 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse38 0) (= (select (store .cse39 (+ |c_~#buffer~0.offset| .cse38) .cse35) .cse1) .cse15) (<= v_z_29 .cse4) (not (= (select .cse39 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (< 2147483647 .cse38) (< .cse3 (+ |c_~#buffer~0.offset| .cse38 1))))) .cse21) (or .cse10 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse41 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse40 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse40 0) (= (select (store .cse41 (+ |c_~#buffer~0.offset| .cse40) .cse35) .cse1) .cse15) (<= v_z_29 .cse4) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse41 .cse16))) (< 2147483647 .cse40) (< .cse3 (+ |c_~#buffer~0.offset| .cse40 1)))))))) (or .cse10 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse42 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse43 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse42 .cse16))) (<= .cse43 2147483647) (= .cse15 (select (store .cse42 (+ |c_~#buffer~0.offset| (- 4294967296) .cse43) .cse35) .cse1)) (<= v_z_29 .cse43)))) .cse26) (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse44 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse45 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse15 (select (store .cse44 (+ |c_~#buffer~0.offset| .cse45) .cse35) .cse14)) (<= v_z_29 .cse4) (not (= (select .cse44 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (< 2147483647 .cse45) (< .cse3 (+ |c_~#buffer~0.offset| .cse45 1))))) .cse21) (or .cse10 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse46 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse6 v_ArrVal_819)) (.cse47 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse15 (select (store .cse46 (+ |c_~#buffer~0.offset| .cse47) .cse35) .cse14)) (<= v_z_29 .cse4) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse46 .cse16))) (< 2147483647 .cse47) (< .cse3 (+ |c_~#buffer~0.offset| .cse47 1))))))) .cse2)) .cse48))) (or .cse5 (let ((.cse51 (+ .cse7 |c_~#buffer~0.offset| (- 4294967296)))) (and (or (and (or .cse48 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse49 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse50 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse49 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse50 2147483647) (= (select (store .cse49 (+ |c_~#buffer~0.offset| (- 4294967296) .cse50) .cse35) .cse1) .cse15) (<= v_z_29 .cse50)))) .cse26) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse52 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse53 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse52 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse0 (+ |c_~#buffer~0.offset| .cse53)) (= (select (store .cse52 (+ |c_~#buffer~0.offset| (- 4294967296) .cse53) .cse35) .cse14) .cse15) (<= v_z_29 .cse4) (<= .cse53 2147483647)))) .cse2) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse54 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse55 (mod (mod .cse17 v_z_29) 4294967296))) (or (not (= (select .cse54 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse55 0) (<= v_z_29 .cse4) (< 2147483647 .cse55) (= (select (store .cse54 (+ |c_~#buffer~0.offset| .cse55) .cse35) .cse14) .cse15) (< .cse3 (+ |c_~#buffer~0.offset| .cse55 1)))))) (or .cse26 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse56 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse57 (mod (mod .cse17 v_z_29) 4294967296))) (or (not (= (select .cse56 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse57 0) (= .cse15 (select (store .cse56 (+ |c_~#buffer~0.offset| .cse57) .cse35) .cse1)) (<= v_z_29 .cse4) (< 2147483647 .cse57) (< .cse3 (+ |c_~#buffer~0.offset| .cse57 1)))))))) (or (and (or .cse26 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse58 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse59 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse58 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse15 (select (store .cse58 (+ |c_~#buffer~0.offset| (- 4294967296) .cse59) .cse13) .cse1)) (<= .cse59 2147483647) (<= v_z_29 .cse59))))) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse60 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse61 (mod (mod .cse17 v_z_29) 4294967296))) (or (not (= (select .cse60 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse61 0) (<= v_z_29 .cse4) (= (select (store .cse60 (+ |c_~#buffer~0.offset| .cse61) .cse13) .cse14) .cse15) (< 2147483647 .cse61) (< .cse3 (+ |c_~#buffer~0.offset| .cse61 1)))))) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse62 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse63 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse62 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (< .cse0 (+ |c_~#buffer~0.offset| .cse63)) (= .cse15 (select (store .cse62 (+ |c_~#buffer~0.offset| (- 4294967296) .cse63) .cse13) .cse14)) (<= v_z_29 .cse4) (<= .cse63 2147483647))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse64 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse65 (mod (mod .cse17 v_z_29) 4294967296))) (or (not (= (select .cse64 .cse20) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse65 0) (= (select (store .cse64 (+ |c_~#buffer~0.offset| .cse65) .cse13) .cse1) .cse15) (<= v_z_29 .cse4) (< 2147483647 .cse65) (< .cse3 (+ |c_~#buffer~0.offset| .cse65 1))))) .cse26)) .cse9)) .cse21) (or .cse10 (and (or .cse9 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse66 (mod (mod .cse17 v_z_29) 4294967296)) (.cse67 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse66)) (= .cse15 (select (store .cse67 (+ |c_~#buffer~0.offset| (- 4294967296) .cse66) .cse13) .cse14)) (<= v_z_29 .cse4) (<= .cse66 2147483647) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse67 .cse16)))))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse69 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse68 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= .cse68 0) (= (select (store .cse69 (+ |c_~#buffer~0.offset| .cse68) .cse13) .cse1) .cse15) (<= v_z_29 .cse4) (< 2147483647 .cse68) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse69 .cse16))) (< .cse3 (+ |c_~#buffer~0.offset| .cse68 1))))) .cse26) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse71 (mod (mod .cse17 v_z_29) 4294967296)) (.cse70 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (= .cse15 (select (store .cse70 (+ |c_~#buffer~0.offset| (- 4294967296) .cse71) .cse13) .cse1)) (<= .cse71 2147483647) (<= v_z_29 .cse71) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse70 .cse16)))))) .cse26) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse73 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse72 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= .cse72 0) (<= v_z_29 .cse4) (= (select (store .cse73 (+ |c_~#buffer~0.offset| .cse72) .cse13) .cse14) .cse15) (< 2147483647 .cse72) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse73 .cse16))) (< .cse3 (+ |c_~#buffer~0.offset| .cse72 1)))))))) (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse75 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse74 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= .cse74 0) (= .cse15 (select (store .cse75 (+ |c_~#buffer~0.offset| .cse74) .cse35) .cse1)) (<= v_z_29 .cse4) (< 2147483647 .cse74) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse75 .cse16))) (< .cse3 (+ |c_~#buffer~0.offset| .cse74 1))))) .cse26) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse76 (mod (mod .cse17 v_z_29) 4294967296)) (.cse77 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse76)) (= (select (store .cse77 (+ |c_~#buffer~0.offset| (- 4294967296) .cse76) .cse35) .cse14) .cse15) (<= v_z_29 .cse4) (<= .cse76 2147483647) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse77 .cse16))))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse78 (mod (mod .cse17 v_z_29) 4294967296)) (.cse79 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (<= .cse78 2147483647) (= (select (store .cse79 (+ |c_~#buffer~0.offset| (- 4294967296) .cse78) .cse35) .cse1) .cse15) (<= v_z_29 .cse78) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse79 .cse16)))))) .cse26) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse81 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse51 v_ArrVal_819)) (.cse80 (mod (mod .cse17 v_z_29) 4294967296))) (or (<= .cse80 0) (<= v_z_29 .cse4) (< 2147483647 .cse80) (= (select (store .cse81 (+ |c_~#buffer~0.offset| .cse80) .cse35) .cse14) .cse15) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse81 .cse16))) (< .cse3 (+ |c_~#buffer~0.offset| .cse80 1))))) .cse2)) .cse48)))))))))) (and (or (< .cse1 0) .cse26) (< .cse1 4294967296))))) is different from true [2023-08-26 14:00:16,137 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#length| |c_~#buffer~0.base|)) (.cse30 (mod c_~next~0 4294967296)) (.cse4 (mod (+ c_~first~0 1) 4294967296))) (let ((.cse2 (<= .cse4 2147483647)) (.cse5 (<= .cse30 2147483647)) (.cse0 (+ .cse3 4294967295)) (.cse31 (< 2147483647 .cse30)) (.cse34 (+ .cse30 |c_~#buffer~0.offset|)) (.cse11 (< 2147483647 .cse4)) (.cse1 (+ |c_~#buffer~0.offset| .cse4))) (or (and (or (< .cse0 .cse1) .cse2) (< .cse3 (+ |c_~#buffer~0.offset| .cse4 1))) (let ((.cse45 (mod c_~first~0 4294967296))) (let ((.cse20 (<= .cse45 2147483647)) (.cse16 (+ |c_~#buffer~0.offset| .cse4 (- 4294967296))) (.cse23 (+ |c_~#buffer~0.offset| .cse45 (- 4294967296))) (.cse19 (< 2147483647 .cse45)) (.cse8 (+ |c_~#buffer~0.offset| .cse45)) (.cse9 (mod (+ c_~next~0 1) 4294967296))) (and (or .cse5 (let ((.cse10 (+ .cse30 |c_~#buffer~0.offset| (- 4294967296)))) (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse6 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse7 (mod (mod .cse9 v_z_29) 4294967296))) (or (= (select (store .cse6 (+ |c_~#buffer~0.offset| .cse7) 1) .cse1) 1) (<= .cse7 0) (not (= (select .cse6 .cse8) 0)) (<= v_z_29 .cse4) (< 2147483647 .cse7) (< .cse3 (+ |c_~#buffer~0.offset| .cse7 1))))) .cse11) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse12 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse13 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse12 .cse8) 0)) (= (select (store .cse12 (+ |c_~#buffer~0.offset| (- 4294967296) .cse13) 1) .cse1) 1) (<= .cse13 2147483647) (<= v_z_29 .cse13)))) .cse11) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse14 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse15 (mod (mod .cse9 v_z_29) 4294967296))) (or (= (select (store .cse14 (+ |c_~#buffer~0.offset| .cse15) 1) .cse16) 1) (<= .cse15 0) (not (= (select .cse14 .cse8) 0)) (<= v_z_29 .cse4) (< 2147483647 .cse15) (< .cse3 (+ |c_~#buffer~0.offset| .cse15 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse18 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse17 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse17)) (= (select (store .cse18 (+ |c_~#buffer~0.offset| (- 4294967296) .cse17) 1) .cse16) 1) (not (= (select .cse18 .cse8) 0)) (<= v_z_29 .cse4) (<= .cse17 2147483647)))) .cse2)) .cse19) (or .cse20 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse21 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse22 (mod (mod .cse9 v_z_29) 4294967296))) (or (= (select (store .cse21 (+ |c_~#buffer~0.offset| .cse22) 1) .cse16) 1) (not (= (select .cse21 .cse23) 0)) (<= .cse22 0) (<= v_z_29 .cse4) (< 2147483647 .cse22) (< .cse3 (+ |c_~#buffer~0.offset| .cse22 1))))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse24 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse25 (mod (mod .cse9 v_z_29) 4294967296))) (or (not (= (select .cse24 .cse23) 0)) (= (select (store .cse24 (+ |c_~#buffer~0.offset| .cse25) 1) .cse1) 1) (<= v_z_29 .cse4) (< 2147483647 .cse25) (< .cse3 (+ |c_~#buffer~0.offset| .cse25 1))))) .cse11) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse26 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse27 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse26 .cse23) 0)) (= (select (store .cse26 (+ |c_~#buffer~0.offset| (- 4294967296) .cse27) 1) .cse1) 1) (<= .cse27 2147483647) (<= v_z_29 .cse27)))) .cse11) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse29 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse28 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse28)) (not (= (select .cse29 .cse23) 0)) (= (select (store .cse29 (+ |c_~#buffer~0.offset| (- 4294967296) .cse28) 1) .cse16) 1) (<= v_z_29 .cse4) (<= .cse28 2147483647)))) .cse2)))))) (or .cse31 (and (or (and (or .cse20 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse32 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse33 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= v_z_29 .cse4) (not (= (select .cse32 .cse23) 0)) (< 2147483647 .cse33) (= (select (store .cse32 (+ |c_~#buffer~0.offset| .cse33) 1) .cse1) 1) (< .cse3 (+ |c_~#buffer~0.offset| .cse33 1)))))) (or .cse19 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse35 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse36 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse35 .cse8) 0)) (<= .cse36 0) (<= v_z_29 .cse4) (< 2147483647 .cse36) (= (select (store .cse35 (+ |c_~#buffer~0.offset| .cse36) 1) .cse1) 1) (< .cse3 (+ |c_~#buffer~0.offset| .cse36 1))))))) .cse11) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse38 (mod (mod .cse9 v_z_29) 4294967296)) (.cse37 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (= (select (store .cse37 (+ |c_~#buffer~0.offset| (- 4294967296) .cse38) 1) .cse16) 1) (<= v_z_29 .cse4) (<= .cse38 2147483647) (not (= (select .cse37 .cse23) 0)))))) (or .cse2 (and (or .cse19 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse39 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse40 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse39 .cse8) 0)) (= (select (store .cse39 (+ |c_~#buffer~0.offset| .cse40) 1) .cse16) 1) (<= v_z_29 .cse4) (< 2147483647 .cse40) (< .cse3 (+ |c_~#buffer~0.offset| .cse40 1)))))) (or .cse20 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse41 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse42 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse41 (+ |c_~#buffer~0.offset| .cse42) 1) .cse16) 1) (<= v_z_29 .cse4) (not (= (select .cse41 .cse23) 0)) (< 2147483647 .cse42) (< .cse3 (+ |c_~#buffer~0.offset| .cse42 1)))))))) (or .cse19 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse43 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse44 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse43 .cse8) 0)) (= (select (store .cse43 (+ |c_~#buffer~0.offset| (- 4294967296) .cse44) 1) .cse1) 1) (<= .cse44 2147483647) (<= v_z_29 .cse44)))) .cse11)))))) (= (mod c_~send~0 256) 0) (and (or .cse5 (< .cse0 .cse34)) (< .cse3 (+ .cse30 |c_~#buffer~0.offset| 1))) (and (< .cse34 4294967296) (or .cse31 (< .cse34 0))) (and (or (< .cse1 0) .cse11) (< .cse1 4294967296))))) is different from false [2023-08-26 14:00:18,143 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#length| |c_~#buffer~0.base|)) (.cse30 (mod c_~next~0 4294967296)) (.cse4 (mod (+ c_~first~0 1) 4294967296))) (let ((.cse2 (<= .cse4 2147483647)) (.cse5 (<= .cse30 2147483647)) (.cse0 (+ .cse3 4294967295)) (.cse31 (< 2147483647 .cse30)) (.cse34 (+ .cse30 |c_~#buffer~0.offset|)) (.cse11 (< 2147483647 .cse4)) (.cse1 (+ |c_~#buffer~0.offset| .cse4))) (or (and (or (< .cse0 .cse1) .cse2) (< .cse3 (+ |c_~#buffer~0.offset| .cse4 1))) (let ((.cse45 (mod c_~first~0 4294967296))) (let ((.cse20 (<= .cse45 2147483647)) (.cse16 (+ |c_~#buffer~0.offset| .cse4 (- 4294967296))) (.cse23 (+ |c_~#buffer~0.offset| .cse45 (- 4294967296))) (.cse19 (< 2147483647 .cse45)) (.cse8 (+ |c_~#buffer~0.offset| .cse45)) (.cse9 (mod (+ c_~next~0 1) 4294967296))) (and (or .cse5 (let ((.cse10 (+ .cse30 |c_~#buffer~0.offset| (- 4294967296)))) (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse6 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse7 (mod (mod .cse9 v_z_29) 4294967296))) (or (= (select (store .cse6 (+ |c_~#buffer~0.offset| .cse7) 1) .cse1) 1) (<= .cse7 0) (not (= (select .cse6 .cse8) 0)) (<= v_z_29 .cse4) (< 2147483647 .cse7) (< .cse3 (+ |c_~#buffer~0.offset| .cse7 1))))) .cse11) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse12 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse13 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse12 .cse8) 0)) (= (select (store .cse12 (+ |c_~#buffer~0.offset| (- 4294967296) .cse13) 1) .cse1) 1) (<= .cse13 2147483647) (<= v_z_29 .cse13)))) .cse11) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse14 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse15 (mod (mod .cse9 v_z_29) 4294967296))) (or (= (select (store .cse14 (+ |c_~#buffer~0.offset| .cse15) 1) .cse16) 1) (<= .cse15 0) (not (= (select .cse14 .cse8) 0)) (<= v_z_29 .cse4) (< 2147483647 .cse15) (< .cse3 (+ |c_~#buffer~0.offset| .cse15 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse18 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse17 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse17)) (= (select (store .cse18 (+ |c_~#buffer~0.offset| (- 4294967296) .cse17) 1) .cse16) 1) (not (= (select .cse18 .cse8) 0)) (<= v_z_29 .cse4) (<= .cse17 2147483647)))) .cse2)) .cse19) (or .cse20 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse21 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse22 (mod (mod .cse9 v_z_29) 4294967296))) (or (= (select (store .cse21 (+ |c_~#buffer~0.offset| .cse22) 1) .cse16) 1) (not (= (select .cse21 .cse23) 0)) (<= .cse22 0) (<= v_z_29 .cse4) (< 2147483647 .cse22) (< .cse3 (+ |c_~#buffer~0.offset| .cse22 1))))) .cse2) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse24 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse25 (mod (mod .cse9 v_z_29) 4294967296))) (or (not (= (select .cse24 .cse23) 0)) (= (select (store .cse24 (+ |c_~#buffer~0.offset| .cse25) 1) .cse1) 1) (<= v_z_29 .cse4) (< 2147483647 .cse25) (< .cse3 (+ |c_~#buffer~0.offset| .cse25 1))))) .cse11) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse26 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse27 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse26 .cse23) 0)) (= (select (store .cse26 (+ |c_~#buffer~0.offset| (- 4294967296) .cse27) 1) .cse1) 1) (<= .cse27 2147483647) (<= v_z_29 .cse27)))) .cse11) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse29 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse10 v_ArrVal_819)) (.cse28 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse0 (+ |c_~#buffer~0.offset| .cse28)) (not (= (select .cse29 .cse23) 0)) (= (select (store .cse29 (+ |c_~#buffer~0.offset| (- 4294967296) .cse28) 1) .cse16) 1) (<= v_z_29 .cse4) (<= .cse28 2147483647)))) .cse2)))))) (or .cse31 (and (or (and (or .cse20 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse32 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse33 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= v_z_29 .cse4) (not (= (select .cse32 .cse23) 0)) (< 2147483647 .cse33) (= (select (store .cse32 (+ |c_~#buffer~0.offset| .cse33) 1) .cse1) 1) (< .cse3 (+ |c_~#buffer~0.offset| .cse33 1)))))) (or .cse19 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse35 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse36 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse35 .cse8) 0)) (<= .cse36 0) (<= v_z_29 .cse4) (< 2147483647 .cse36) (= (select (store .cse35 (+ |c_~#buffer~0.offset| .cse36) 1) .cse1) 1) (< .cse3 (+ |c_~#buffer~0.offset| .cse36 1))))))) .cse11) (or .cse2 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse38 (mod (mod .cse9 v_z_29) 4294967296)) (.cse37 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819))) (or (<= 4294967296 v_z_29) (= (select (store .cse37 (+ |c_~#buffer~0.offset| (- 4294967296) .cse38) 1) .cse16) 1) (<= v_z_29 .cse4) (<= .cse38 2147483647) (not (= (select .cse37 .cse23) 0)))))) (or .cse2 (and (or .cse19 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse39 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse40 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse39 .cse8) 0)) (= (select (store .cse39 (+ |c_~#buffer~0.offset| .cse40) 1) .cse16) 1) (<= v_z_29 .cse4) (< 2147483647 .cse40) (< .cse3 (+ |c_~#buffer~0.offset| .cse40 1)))))) (or .cse20 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse41 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse42 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse41 (+ |c_~#buffer~0.offset| .cse42) 1) .cse16) 1) (<= v_z_29 .cse4) (not (= (select .cse41 .cse23) 0)) (< 2147483647 .cse42) (< .cse3 (+ |c_~#buffer~0.offset| .cse42 1)))))))) (or .cse19 (forall ((v_z_29 Int) (v_ArrVal_819 Int) (v_ArrVal_817 (Array Int Int))) (let ((.cse43 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_817) |c_~#buffer~0.base|) .cse34 v_ArrVal_819)) (.cse44 (mod (mod .cse9 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse43 .cse8) 0)) (= (select (store .cse43 (+ |c_~#buffer~0.offset| (- 4294967296) .cse44) 1) .cse1) 1) (<= .cse44 2147483647) (<= v_z_29 .cse44)))) .cse11)))))) (= (mod c_~send~0 256) 0) (and (or .cse5 (< .cse0 .cse34)) (< .cse3 (+ .cse30 |c_~#buffer~0.offset| 1))) (and (< .cse34 4294967296) (or .cse31 (< .cse34 0))) (and (or (< .cse1 0) .cse11) (< .cse1 4294967296))))) is different from true [2023-08-26 14:00:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-26 14:00:28,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 14:00:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796203251] [2023-08-26 14:00:28,178 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 14:00:28,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760596546] [2023-08-26 14:00:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760596546] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 14:00:28,178 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-26 14:00:28,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2023-08-26 14:00:28,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773919699] [2023-08-26 14:00:28,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-26 14:00:28,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 14:00:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 14:00:28,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 14:00:28,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=786, Unknown=6, NotChecked=180, Total=1122 [2023-08-26 14:00:28,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 344 [2023-08-26 14:00:28,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 49 transitions, 276 flow. Second operand has 34 states, 34 states have (on average 78.88235294117646) internal successors, (2682), 34 states have internal predecessors, (2682), 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) [2023-08-26 14:00:28,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 14:00:28,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 344 [2023-08-26 14:00:28,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 14:00:49,120 WARN L234 SmtUtils]: Spent 5.16s on a formula simplification. DAG size of input: 436 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:03:56,020 WARN L234 SmtUtils]: Spent 3.05m on a formula simplification. DAG size of input: 365 DAG size of output: 349 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:05:27,638 WARN L234 SmtUtils]: Spent 1.47m on a formula simplification that was a NOOP. DAG size: 319 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:05:30,163 WARN L861 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_~#buffer~0.base|)) (.cse17 (+ |c_t1Thread1of1ForFork1_~i~0#1| 1)) (.cse14 (mod (+ c_~first~0 1) 4294967296)) (.cse1 (mod c_~first~0 4294967296))) (let ((.cse12 (+ |c_~#buffer~0.offset| .cse1 (- 4294967296))) (.cse19 (select |c_#memory_int| |c_~#buffer~0.base|)) (.cse3 (+ |c_~#buffer~0.offset| .cse1)) (.cse25 (< 2147483647 .cse14)) (.cse15 (mod .cse17 256)) (.cse2 (+ .cse0 4294967295)) (.cse24 (+ |c_~#buffer~0.offset| .cse14)) (.cse21 (<= .cse14 2147483647))) (let ((.cse9 (mod c_~next~0 4294967296)) (.cse10 (and (or (< .cse2 .cse24) .cse21) (< .cse0 (+ |c_~#buffer~0.offset| .cse14 1)))) (.cse31 (<= .cse15 127)) (.cse34 (+ (- 256) .cse15)) (.cse16 (+ |c_~#buffer~0.offset| .cse14 (- 4294967296))) (.cse18 (mod (+ c_~next~0 1) 4294967296)) (.cse30 (< 127 .cse15)) (.cse88 (and (or (< .cse24 0) .cse25) (< .cse24 4294967296))) (.cse5 (< 2147483647 .cse1)) (.cse8 (select .cse19 .cse3)) (.cse4 (<= .cse1 2147483647)) (.cse7 (select .cse19 .cse12)) (.cse6 (mod c_~buffer_size~0 4294967296))) (and (or (and (< .cse0 (+ |c_~#buffer~0.offset| .cse1 1)) (or (< .cse2 .cse3) .cse4)) (and (< .cse3 4294967296) (or .cse5 (< .cse3 0))) (<= .cse6 .cse1) (and (or .cse4 (= c_~value~0 .cse7)) (or .cse5 (= c_~value~0 .cse8)))) (= c_~value~0 0) (< .cse9 .cse6) (let ((.cse57 (<= .cse9 2147483647)) (.cse58 (< 2147483647 .cse9)) (.cse61 (+ .cse9 |c_~#buffer~0.offset|))) (or .cse10 (= (mod c_~send~0 256) 0) (and (or (let ((.cse20 (+ .cse9 |c_~#buffer~0.offset| (- 4294967296)))) (and (or (and (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse11 (store .cse19 .cse20 v_ArrVal_819)) (.cse13 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse11 .cse12))) (<= .cse13 0) (<= v_z_29 .cse14) (< 2147483647 .cse13) (= (select (store .cse11 (+ |c_~#buffer~0.offset| .cse13) .cse15) .cse16) .cse17) (< .cse0 (+ |c_~#buffer~0.offset| .cse13 1))))) .cse21) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse22 (store .cse19 .cse20 v_ArrVal_819)) (.cse23 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse22 (+ |c_~#buffer~0.offset| (- 4294967296) .cse23) .cse15) .cse24) .cse17) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse22 .cse12))) (<= .cse23 2147483647) (<= v_z_29 .cse23)))) .cse25) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse27 (store .cse19 .cse20 v_ArrVal_819)) (.cse26 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse2 (+ |c_~#buffer~0.offset| .cse26)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse27 .cse12))) (<= v_z_29 .cse14) (<= .cse26 2147483647) (= (select (store .cse27 (+ |c_~#buffer~0.offset| (- 4294967296) .cse26) .cse15) .cse16) .cse17)))) .cse21) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse28 (store .cse19 .cse20 v_ArrVal_819)) (.cse29 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse28 .cse12))) (<= .cse29 0) (= .cse17 (select (store .cse28 (+ |c_~#buffer~0.offset| .cse29) .cse15) .cse24)) (<= v_z_29 .cse14) (< 2147483647 .cse29) (< .cse0 (+ |c_~#buffer~0.offset| .cse29 1))))) .cse25)) .cse30) (or .cse31 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse33 (store .cse19 .cse20 v_ArrVal_819)) (.cse32 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse2 (+ |c_~#buffer~0.offset| .cse32)) (= .cse17 (select (store .cse33 (+ |c_~#buffer~0.offset| (- 4294967296) .cse32) .cse34) .cse16)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse33 .cse12))) (<= v_z_29 .cse14) (<= .cse32 2147483647)))) .cse21) (or .cse25 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse35 (store .cse19 .cse20 v_ArrVal_819)) (.cse36 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse35 .cse12))) (<= .cse36 0) (= (select (store .cse35 (+ |c_~#buffer~0.offset| .cse36) .cse34) .cse24) .cse17) (<= v_z_29 .cse14) (< 2147483647 .cse36) (< .cse0 (+ |c_~#buffer~0.offset| .cse36 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse37 (store .cse19 .cse20 v_ArrVal_819)) (.cse38 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse37 .cse12))) (= (select (store .cse37 (+ |c_~#buffer~0.offset| (- 4294967296) .cse38) .cse34) .cse24) .cse17) (<= .cse38 2147483647) (<= v_z_29 .cse38)))) .cse25) (or .cse21 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse39 (store .cse19 .cse20 v_ArrVal_819)) (.cse40 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse39 .cse12))) (<= .cse40 0) (= (select (store .cse39 (+ |c_~#buffer~0.offset| .cse40) .cse34) .cse16) .cse17) (<= v_z_29 .cse14) (< 2147483647 .cse40) (< .cse0 (+ |c_~#buffer~0.offset| .cse40 1))))))))) .cse4) (or .cse5 (and (or .cse31 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse41 (store .cse19 .cse20 v_ArrVal_819)) (.cse42 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse41 .cse3))) (<= .cse42 0) (= (select (store .cse41 (+ |c_~#buffer~0.offset| .cse42) .cse34) .cse24) .cse17) (<= v_z_29 .cse14) (< 2147483647 .cse42) (< .cse0 (+ |c_~#buffer~0.offset| .cse42 1))))) .cse25) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse43 (store .cse19 .cse20 v_ArrVal_819)) (.cse44 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse43 .cse3))) (<= .cse44 0) (= (select (store .cse43 (+ |c_~#buffer~0.offset| .cse44) .cse34) .cse16) .cse17) (<= v_z_29 .cse14) (< 2147483647 .cse44) (< .cse0 (+ |c_~#buffer~0.offset| .cse44 1))))) .cse21) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse45 (store .cse19 .cse20 v_ArrVal_819)) (.cse46 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse45 .cse3))) (= (select (store .cse45 (+ |c_~#buffer~0.offset| (- 4294967296) .cse46) .cse34) .cse24) .cse17) (<= .cse46 2147483647) (<= v_z_29 .cse46)))) .cse25) (or .cse21 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse48 (store .cse19 .cse20 v_ArrVal_819)) (.cse47 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse2 (+ |c_~#buffer~0.offset| .cse47)) (= .cse17 (select (store .cse48 (+ |c_~#buffer~0.offset| (- 4294967296) .cse47) .cse34) .cse16)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse48 .cse3))) (<= v_z_29 .cse14) (<= .cse47 2147483647))))))) (or .cse30 (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse49 (store .cse19 .cse20 v_ArrVal_819)) (.cse50 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse49 (+ |c_~#buffer~0.offset| (- 4294967296) .cse50) .cse15) .cse24) .cse17) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse49 .cse3))) (<= .cse50 2147483647) (<= v_z_29 .cse50)))) .cse25) (or .cse21 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse51 (store .cse19 .cse20 v_ArrVal_819)) (.cse52 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse51 .cse3))) (<= .cse52 0) (<= v_z_29 .cse14) (< 2147483647 .cse52) (= (select (store .cse51 (+ |c_~#buffer~0.offset| .cse52) .cse15) .cse16) .cse17) (< .cse0 (+ |c_~#buffer~0.offset| .cse52 1)))))) (or .cse25 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse53 (store .cse19 .cse20 v_ArrVal_819)) (.cse54 (mod (mod .cse18 v_z_29) 4294967296))) (or (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse53 .cse3))) (<= .cse54 0) (= .cse17 (select (store .cse53 (+ |c_~#buffer~0.offset| .cse54) .cse15) .cse24)) (<= v_z_29 .cse14) (< 2147483647 .cse54) (< .cse0 (+ |c_~#buffer~0.offset| .cse54 1)))))) (or .cse21 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse56 (store .cse19 .cse20 v_ArrVal_819)) (.cse55 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse2 (+ |c_~#buffer~0.offset| .cse55)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse56 .cse3))) (<= v_z_29 .cse14) (<= .cse55 2147483647) (= (select (store .cse56 (+ |c_~#buffer~0.offset| (- 4294967296) .cse55) .cse15) .cse16) .cse17))))))))))) .cse57) (or .cse58 (and (or (and (or (and (or .cse5 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse59 (store .cse19 .cse61 v_ArrVal_819)) (.cse60 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse59 (+ |c_~#buffer~0.offset| (- 4294967296) .cse60) .cse15) .cse16) .cse17) (not (= (select .cse59 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse14) (<= .cse60 2147483647))))) (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse62 (store .cse19 .cse61 v_ArrVal_819)) (.cse63 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse62 (+ |c_~#buffer~0.offset| (- 4294967296) .cse63) .cse15) .cse16) .cse17) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse62 .cse12))) (<= v_z_29 .cse14) (<= .cse63 2147483647))))) .cse21) (or (and (or .cse4 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse65 (store .cse19 .cse61 v_ArrVal_819)) (.cse64 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse64 0) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse65 .cse12))) (<= v_z_29 .cse14) (< 2147483647 .cse64) (= .cse17 (select (store .cse65 (+ |c_~#buffer~0.offset| .cse64) .cse15) .cse24)) (< .cse0 (+ |c_~#buffer~0.offset| .cse64 1)))))) (or .cse5 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse66 (store .cse19 .cse61 v_ArrVal_819)) (.cse67 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse66 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse67 0) (<= v_z_29 .cse14) (< 2147483647 .cse67) (= .cse17 (select (store .cse66 (+ |c_~#buffer~0.offset| .cse67) .cse15) .cse24)) (< .cse0 (+ |c_~#buffer~0.offset| .cse67 1))))))) .cse25) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse68 (store .cse19 .cse61 v_ArrVal_819)) (.cse69 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse17 (select (store .cse68 (+ |c_~#buffer~0.offset| (- 4294967296) .cse69) .cse15) .cse24)) (not (= (select .cse68 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse69 2147483647) (<= v_z_29 .cse69)))) .cse5 .cse25) (or (and (or .cse5 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse70 (store .cse19 .cse61 v_ArrVal_819)) (.cse71 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse70 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (= .cse17 (select (store .cse70 (+ |c_~#buffer~0.offset| .cse71) .cse15) .cse16)) (<= v_z_29 .cse14) (< 2147483647 .cse71) (< .cse0 (+ |c_~#buffer~0.offset| .cse71 1)))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse72 (store .cse19 .cse61 v_ArrVal_819)) (.cse73 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse17 (select (store .cse72 (+ |c_~#buffer~0.offset| .cse73) .cse15) .cse16)) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse72 .cse12))) (<= v_z_29 .cse14) (< 2147483647 .cse73) (< .cse0 (+ |c_~#buffer~0.offset| .cse73 1))))) .cse4)) .cse21)) .cse30) (or .cse31 (and (or (and (or .cse5 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse74 (store .cse19 .cse61 v_ArrVal_819)) (.cse75 (mod (mod .cse18 v_z_29) 4294967296))) (or (= (select (store .cse74 (+ |c_~#buffer~0.offset| .cse75) .cse34) .cse24) .cse17) (<= 4294967296 v_z_29) (not (= (select .cse74 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse75 0) (<= v_z_29 .cse14) (< 2147483647 .cse75) (< .cse0 (+ |c_~#buffer~0.offset| .cse75 1)))))) (or .cse4 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse76 (store .cse19 .cse61 v_ArrVal_819)) (.cse77 (mod (mod .cse18 v_z_29) 4294967296))) (or (= (select (store .cse76 (+ |c_~#buffer~0.offset| .cse77) .cse34) .cse24) .cse17) (<= 4294967296 v_z_29) (<= .cse77 0) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse76 .cse12))) (<= v_z_29 .cse14) (< 2147483647 .cse77) (< .cse0 (+ |c_~#buffer~0.offset| .cse77 1))))))) .cse25) (or (and (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse78 (store .cse19 .cse61 v_ArrVal_819)) (.cse79 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse78 .cse12))) (<= v_z_29 .cse14) (< 2147483647 .cse79) (= (select (store .cse78 (+ |c_~#buffer~0.offset| .cse79) .cse34) .cse16) .cse17) (< .cse0 (+ |c_~#buffer~0.offset| .cse79 1))))) .cse4) (or .cse5 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse80 (store .cse19 .cse61 v_ArrVal_819)) (.cse81 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (not (= (select .cse80 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse14) (< 2147483647 .cse81) (= (select (store .cse80 (+ |c_~#buffer~0.offset| .cse81) .cse34) .cse16) .cse17) (< .cse0 (+ |c_~#buffer~0.offset| .cse81 1))))))) .cse21) (or .cse21 (and (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse82 (store .cse19 .cse61 v_ArrVal_819)) (.cse83 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse82 (+ |c_~#buffer~0.offset| (- 4294967296) .cse83) .cse34) .cse16) .cse17) (not (= |c_t1Thread1of1ForFork1_~i~0#1| (select .cse82 .cse12))) (<= v_z_29 .cse14) (<= .cse83 2147483647)))) (or .cse5 (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse84 (store .cse19 .cse61 v_ArrVal_819)) (.cse85 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse84 (+ |c_~#buffer~0.offset| (- 4294967296) .cse85) .cse34) .cse16) .cse17) (not (= (select .cse84 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= v_z_29 .cse14) (<= .cse85 2147483647))))))) (or (forall ((v_z_29 Int) (v_ArrVal_819 Int)) (let ((.cse86 (store .cse19 .cse61 v_ArrVal_819)) (.cse87 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse86 (+ |c_~#buffer~0.offset| (- 4294967296) .cse87) .cse34) .cse24) .cse17) (not (= (select .cse86 .cse3) |c_t1Thread1of1ForFork1_~i~0#1|)) (<= .cse87 2147483647) (<= v_z_29 .cse87)))) .cse5 .cse25)))))) (and (or .cse57 (< .cse2 .cse61)) (< .cse0 (+ .cse9 |c_~#buffer~0.offset| 1))) (and (< .cse61 4294967296) (or .cse58 (< .cse61 0))) .cse88)) (= |c_~#buffer~0.offset| 0) (let ((.cse92 (mod |c_t2Thread1of1ForFork0_removeLogElement_#t~post1#1| 4294967296))) (let ((.cse90 (< 2147483647 .cse92)) (.cse89 (+ |c_~#buffer~0.offset| .cse92)) (.cse91 (<= .cse92 2147483647))) (or (and (or (= c_~value~0 (select .cse19 .cse89)) .cse90) (or .cse91 (= c_~value~0 (select .cse19 (+ |c_~#buffer~0.offset| .cse92 (- 4294967296)))))) (and (< .cse89 4294967296) (or .cse90 (< .cse89 0))) (and (< .cse0 (+ |c_~#buffer~0.offset| .cse92 1)) (or (< .cse2 .cse89) .cse91))))) (exists ((v_ArrVal_819 Int)) (= (store ((as const (Array Int Int)) 0) 0 v_ArrVal_819) (select |c_#memory_int| 3))) (or .cse10 (and (or .cse31 (and (or (forall ((v_z_29 Int)) (let ((.cse93 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse2 (+ |c_~#buffer~0.offset| .cse93)) (= .cse17 (select (store .cse19 (+ |c_~#buffer~0.offset| (- 4294967296) .cse93) .cse34) .cse16)) (<= v_z_29 .cse14) (<= .cse93 2147483647)))) .cse21) (or (forall ((v_z_29 Int)) (let ((.cse94 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse94 0) (<= v_z_29 .cse14) (< 2147483647 .cse94) (< .cse0 (+ |c_~#buffer~0.offset| .cse94 1)) (= (select (store .cse19 (+ |c_~#buffer~0.offset| .cse94) .cse34) .cse24) .cse17)))) .cse25) (or (forall ((v_z_29 Int)) (let ((.cse95 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse17 (select (store .cse19 (+ |c_~#buffer~0.offset| (- 4294967296) .cse95) .cse34) .cse24)) (<= .cse95 2147483647) (<= v_z_29 .cse95)))) .cse25) (or .cse21 (forall ((v_z_29 Int)) (let ((.cse96 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse19 (+ |c_~#buffer~0.offset| .cse96) .cse34) .cse16) .cse17) (<= .cse96 0) (<= v_z_29 .cse14) (< 2147483647 .cse96) (< .cse0 (+ |c_~#buffer~0.offset| .cse96 1)))))))) (or (and (or (forall ((v_z_29 Int)) (let ((.cse97 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= (select (store .cse19 (+ |c_~#buffer~0.offset| .cse97) .cse15) .cse16) .cse17) (<= .cse97 0) (<= v_z_29 .cse14) (< 2147483647 .cse97) (< .cse0 (+ |c_~#buffer~0.offset| .cse97 1))))) .cse21) (or (forall ((v_z_29 Int)) (let ((.cse98 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (<= .cse98 0) (= .cse17 (select (store .cse19 (+ |c_~#buffer~0.offset| .cse98) .cse15) .cse24)) (<= v_z_29 .cse14) (< 2147483647 .cse98) (< .cse0 (+ |c_~#buffer~0.offset| .cse98 1))))) .cse25) (or (forall ((v_z_29 Int)) (let ((.cse99 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (= .cse17 (select (store .cse19 (+ |c_~#buffer~0.offset| (- 4294967296) .cse99) .cse15) .cse24)) (<= .cse99 2147483647) (<= v_z_29 .cse99)))) .cse25) (or .cse21 (forall ((v_z_29 Int)) (let ((.cse100 (mod (mod .cse18 v_z_29) 4294967296))) (or (<= 4294967296 v_z_29) (< .cse2 (+ |c_~#buffer~0.offset| .cse100)) (<= v_z_29 .cse14) (<= .cse100 2147483647) (= .cse17 (select (store .cse19 (+ |c_~#buffer~0.offset| (- 4294967296) .cse100) .cse15) .cse16))))))) .cse30)) .cse88 (and (or .cse5 (not (= .cse8 |c_t1Thread1of1ForFork1_~i~0#1|))) (or .cse4 (not (= .cse7 |c_t1Thread1of1ForFork1_~i~0#1|))))) (= (select |c_#length| 3) 10) (= |c_t1Thread1of1ForFork1_~i~0#1| 1) (= c_~next~0 (mod 1 .cse6)) (= 3 |c_~#buffer~0.base|) (= c_~first~0 0))))) is different from true [2023-08-26 14:05:33,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:05:35,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:05:37,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:05:39,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:05:41,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:05:44,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:05:48,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:07:14,737 WARN L234 SmtUtils]: Spent 1.39m on a formula simplification that was a NOOP. DAG size: 315 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 14:07:17,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:07:20,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2023-08-26 14:07:22,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] Received shutdown request... [2023-08-26 14:07:58,818 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 14:07:58,832 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 14:07:59,427 WARN L266 SmtUtils]: Removed 17 from assertion stack [2023-08-26 14:07:59,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 14:07:59,428 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONASSERT (23 of 24 remaining) [2023-08-26 14:07:59,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 14:07:59,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-26 14:07:59,629 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. [2023-08-26 14:07:59,630 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 24 remaining) [2023-08-26 14:07:59,630 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 24 remaining) [2023-08-26 14:07:59,630 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 24 remaining) [2023-08-26 14:07:59,630 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONASSERT (10 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONASSERT (9 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 24 remaining) [2023-08-26 14:07:59,631 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 24 remaining) [2023-08-26 14:07:59,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONASSERT (6 of 24 remaining) [2023-08-26 14:07:59,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 24 remaining) [2023-08-26 14:07:59,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 24 remaining) [2023-08-26 14:07:59,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONASSERT (3 of 24 remaining) [2023-08-26 14:07:59,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONASSERT (2 of 24 remaining) [2023-08-26 14:07:59,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 24 remaining) [2023-08-26 14:07:59,632 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 24 remaining) [2023-08-26 14:07:59,632 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 14:07:59,636 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 14:07:59,636 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 14:07:59,638 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:07:59 BasicIcfg [2023-08-26 14:07:59,638 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 14:07:59,638 INFO L158 Benchmark]: Toolchain (without parser) took 871692.72ms. Allocated memory was 402.7MB in the beginning and 715.1MB in the end (delta: 312.5MB). Free memory was 377.7MB in the beginning and 517.8MB in the end (delta: -140.1MB). Peak memory consumption was 173.0MB. Max. memory is 16.0GB. [2023-08-26 14:07:59,638 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 402.7MB. Free memory is still 379.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 14:07:59,639 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.01ms. Allocated memory is still 402.7MB. Free memory was 377.2MB in the beginning and 357.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 14:07:59,639 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.82ms. Allocated memory is still 402.7MB. Free memory was 357.3MB in the beginning and 354.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 14:07:59,639 INFO L158 Benchmark]: Boogie Preprocessor took 31.68ms. Allocated memory is still 402.7MB. Free memory was 354.7MB in the beginning and 352.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 14:07:59,639 INFO L158 Benchmark]: RCFGBuilder took 608.43ms. Allocated memory is still 402.7MB. Free memory was 352.6MB in the beginning and 332.5MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-08-26 14:07:59,639 INFO L158 Benchmark]: TraceAbstraction took 870521.80ms. Allocated memory was 402.7MB in the beginning and 715.1MB in the end (delta: 312.5MB). Free memory was 332.2MB in the beginning and 517.8MB in the end (delta: -185.6MB). Peak memory consumption was 128.9MB. Max. memory is 16.0GB. [2023-08-26 14:07:59,641 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 402.7MB. Free memory is still 379.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 487.01ms. Allocated memory is still 402.7MB. Free memory was 377.2MB in the beginning and 357.3MB in the end (delta: 19.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.82ms. Allocated memory is still 402.7MB. Free memory was 357.3MB in the beginning and 354.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.68ms. Allocated memory is still 402.7MB. Free memory was 354.7MB in the beginning and 352.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 608.43ms. Allocated memory is still 402.7MB. Free memory was 352.6MB in the beginning and 332.5MB in the end (delta: 20.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 870521.80ms. Allocated memory was 402.7MB in the beginning and 715.1MB in the end (delta: 312.5MB). Free memory was 332.2MB in the beginning and 517.8MB in the end (delta: -185.6MB). Peak memory consumption was 128.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 208]: Unsoundness Warning unspecified type, defaulting to int C: short [208] - GenericResultAtLocation [Line: 209]: Unsoundness Warning unspecified type, defaulting to int C: short [209] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.6s, 154 PlacesBefore, 50 PlacesAfterwards, 161 TransitionsBefore, 51 TransitionsAfterwards, 6922 CoEnabledTransitionPairs, 7 FixpointIterations, 54 TrivialSequentialCompositions, 91 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 21 ConcurrentYvCompositions, 6 ChoiceCompositions, 172 TotalNumberOfCompositions, 17080 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11110, independent: 10743, independent conditional: 0, independent unconditional: 10743, dependent: 367, dependent conditional: 0, dependent unconditional: 367, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 4167, independent: 4098, independent conditional: 0, independent unconditional: 4098, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11110, independent: 6645, independent conditional: 0, independent unconditional: 6645, dependent: 298, dependent conditional: 0, dependent unconditional: 298, unknown: 4167, unknown conditional: 0, unknown unconditional: 4167] , Statistics on independence cache: Total cache size (in pairs): 412, Positive cache size: 387, Positive conditional cache size: 0, Positive unconditional cache size: 387, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: 681]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 434 for 34093ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 246 locations, 24 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 870.4s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 456.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.7s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 875 SdHoareTripleChecker+Valid, 31.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 875 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 30.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 558 IncrementalHoareTripleChecker+Unchecked, 20 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2420 IncrementalHoareTripleChecker+Invalid, 3064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 4 mSDtfsCounter, 2420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 332 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 630.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=17, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 403.9s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 322 ConstructedInterpolants, 30 QuantifiedInterpolants, 38911 SizeOfPredicates, 51 NumberOfNonLiveVariables, 2348 ConjunctsInSsa, 212 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 4/58 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown