/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 --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -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/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 16:10:42,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 16:10:42,400 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 16:10:42,405 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 16:10:42,406 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 16:10:42,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 16:10:42,441 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 16:10:42,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 16:10:42,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 16:10:42,442 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 16:10:42,443 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 16:10:42,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 16:10:42,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 16:10:42,444 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 16:10:42,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 16:10:42,444 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 16:10:42,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 16:10:42,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 16:10:42,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 16:10:42,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 16:10:42,452 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 16:10:42,452 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 16:10:42,452 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 16:10:42,453 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 16:10:42,453 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 16:10:42,453 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 16:10:42,453 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 16:10:42,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:10:42,454 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 16:10:42,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 16:10:42,455 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 16:10:42,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 16:10:42,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 16:10:42,456 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 16:10:42,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 16:10:42,456 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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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 16:10:42,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 16:10:42,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 16:10:42,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 16:10:42,797 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 16:10:42,798 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 16:10:42,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 16:10:44,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 16:10:44,300 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 16:10:44,301 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 16:10:44,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da29f05c8/3180fb18f5934dd5b4d74a260d03d77b/FLAG8f24cddae [2023-08-26 16:10:44,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da29f05c8/3180fb18f5934dd5b4d74a260d03d77b [2023-08-26 16:10:44,328 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 16:10:44,330 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 16:10:44,331 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 16:10:44,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 16:10:44,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 16:10:44,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567a4a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44, skipping insertion in model container [2023-08-26 16:10:44,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,355 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 16:10:44,497 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:10:44,506 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 16:10:44,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 16:10:44,550 INFO L206 MainTranslator]: Completed translation [2023-08-26 16:10:44,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44 WrapperNode [2023-08-26 16:10:44,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 16:10:44,553 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 16:10:44,553 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 16:10:44,553 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 16:10:44,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,574 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,597 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2023-08-26 16:10:44,598 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 16:10:44,599 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 16:10:44,599 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 16:10:44,599 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 16:10:44,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,610 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,610 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,628 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 16:10:44,631 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 16:10:44,631 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 16:10:44,631 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 16:10:44,632 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (1/1) ... [2023-08-26 16:10:44,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 16:10:44,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:44,691 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 16:10:44,715 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 16:10:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 16:10:44,729 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 16:10:44,729 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 16:10:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 16:10:44,730 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 16:10:44,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 16:10:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 16:10:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 16:10:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 16:10:44,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 16:10:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 16:10:44,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 16:10:44,733 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 16:10:44,825 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 16:10:44,827 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 16:10:44,973 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 16:10:44,979 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 16:10:44,980 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 16:10:44,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:10:44 BoogieIcfgContainer [2023-08-26 16:10:44,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 16:10:44,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 16:10:44,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 16:10:44,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 16:10:44,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 04:10:44" (1/3) ... [2023-08-26 16:10:44,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab78002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:10:44, skipping insertion in model container [2023-08-26 16:10:44,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 04:10:44" (2/3) ... [2023-08-26 16:10:44,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab78002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 04:10:44, skipping insertion in model container [2023-08-26 16:10:44,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 04:10:44" (3/3) ... [2023-08-26 16:10:44,989 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-26 16:10:45,004 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 16:10:45,004 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 16:10:45,004 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 16:10:45,061 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 16:10:45,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 86 transitions, 188 flow [2023-08-26 16:10:45,167 INFO L124 PetriNetUnfolderBase]: 6/84 cut-off events. [2023-08-26 16:10:45,168 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 16:10:45,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 6/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 46 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-08-26 16:10:45,174 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 86 transitions, 188 flow [2023-08-26 16:10:45,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 75 transitions, 162 flow [2023-08-26 16:10:45,182 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 16:10:45,199 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 76 places, 75 transitions, 162 flow [2023-08-26 16:10:45,203 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 76 places, 75 transitions, 162 flow [2023-08-26 16:10:45,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 75 transitions, 162 flow [2023-08-26 16:10:45,235 INFO L124 PetriNetUnfolderBase]: 6/75 cut-off events. [2023-08-26 16:10:45,236 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 16:10:45,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 75 events. 6/75 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-08-26 16:10:45,238 INFO L119 LiptonReduction]: Number of co-enabled transitions 348 [2023-08-26 16:10:47,941 INFO L134 LiptonReduction]: Checked pairs total: 457 [2023-08-26 16:10:47,942 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-26 16:10:47,954 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 16:10:47,960 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;@242bf440, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 16:10:47,960 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-26 16:10:47,961 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 16:10:47,961 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 16:10:47,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 16:10:47,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:47,962 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 16:10:47,962 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:47,966 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash 319, now seen corresponding path program 1 times [2023-08-26 16:10:47,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:47,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445048214] [2023-08-26 16:10:47,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:47,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:48,035 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 16:10:48,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:48,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445048214] [2023-08-26 16:10:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445048214] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:48,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:48,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 16:10:48,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36731859] [2023-08-26 16:10:48,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:48,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 16:10:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:48,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 16:10:48,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 16:10:48,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 164 [2023-08-26 16:10:48,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 16:10:48,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:48,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 164 [2023-08-26 16:10:48,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:48,123 INFO L124 PetriNetUnfolderBase]: 45/80 cut-off events. [2023-08-26 16:10:48,124 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-26 16:10:48,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 80 events. 45/80 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 150 event pairs, 21 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 124. Up to 81 conditions per place. [2023-08-26 16:10:48,126 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 19 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 16:10:48,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 19 transitions, 88 flow [2023-08-26 16:10:48,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 16:10:48,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 16:10:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 175 transitions. [2023-08-26 16:10:48,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335365853658537 [2023-08-26 16:10:48,137 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 175 transitions. [2023-08-26 16:10:48,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 175 transitions. [2023-08-26 16:10:48,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:48,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 175 transitions. [2023-08-26 16:10:48,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 87.5) internal successors, (175), 2 states have internal predecessors, (175), 0 states have call successors, (0), 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 16:10:48,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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 16:10:48,146 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 164.0) internal successors, (492), 3 states have internal predecessors, (492), 0 states have call successors, (0), 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 16:10:48,148 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 54 flow. Second operand 2 states and 175 transitions. [2023-08-26 16:10:48,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 19 transitions, 88 flow [2023-08-26 16:10:48,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 19 transitions, 80 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 16:10:48,151 INFO L231 Difference]: Finished difference. Result has 21 places, 19 transitions, 42 flow [2023-08-26 16:10:48,153 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=21, PETRI_TRANSITIONS=19} [2023-08-26 16:10:48,155 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -5 predicate places. [2023-08-26 16:10:48,155 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 19 transitions, 42 flow [2023-08-26 16:10:48,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.5) internal successors, (155), 2 states have internal predecessors, (155), 0 states have call successors, (0), 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 16:10:48,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:48,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:10:48,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 16:10:48,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:48,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:48,157 INFO L85 PathProgramCache]: Analyzing trace with hash 314240, now seen corresponding path program 1 times [2023-08-26 16:10:48,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:48,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282977752] [2023-08-26 16:10:48,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:48,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:48,305 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 16:10:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282977752] [2023-08-26 16:10:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282977752] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:48,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:48,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669308496] [2023-08-26 16:10:48,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:48,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:48,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:48,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:48,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:48,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 164 [2023-08-26 16:10:48,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 16:10:48,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:48,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 164 [2023-08-26 16:10:48,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:48,351 INFO L124 PetriNetUnfolderBase]: 41/72 cut-off events. [2023-08-26 16:10:48,351 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 16:10:48,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 41/72 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 129 event pairs, 19 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 147. Up to 72 conditions per place. [2023-08-26 16:10:48,352 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 16 selfloop transitions, 1 changer transitions 0/17 dead transitions. [2023-08-26 16:10:48,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 17 transitions, 72 flow [2023-08-26 16:10:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2023-08-26 16:10:48,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39227642276422764 [2023-08-26 16:10:48,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 193 transitions. [2023-08-26 16:10:48,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 193 transitions. [2023-08-26 16:10:48,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:48,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 193 transitions. [2023-08-26 16:10:48,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 64.33333333333333) internal successors, (193), 3 states have internal predecessors, (193), 0 states have call successors, (0), 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 16:10:48,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,358 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,358 INFO L175 Difference]: Start difference. First operand has 21 places, 19 transitions, 42 flow. Second operand 3 states and 193 transitions. [2023-08-26 16:10:48,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 17 transitions, 72 flow [2023-08-26 16:10:48,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 17 transitions, 72 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 16:10:48,359 INFO L231 Difference]: Finished difference. Result has 21 places, 17 transitions, 40 flow [2023-08-26 16:10:48,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=21, PETRI_TRANSITIONS=17} [2023-08-26 16:10:48,360 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -5 predicate places. [2023-08-26 16:10:48,360 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 17 transitions, 40 flow [2023-08-26 16:10:48,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 16:10:48,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:48,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 16:10:48,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 16:10:48,361 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:48,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash 314241, now seen corresponding path program 1 times [2023-08-26 16:10:48,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:48,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457550897] [2023-08-26 16:10:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:48,446 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 16:10:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:48,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457550897] [2023-08-26 16:10:48,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457550897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:48,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796279370] [2023-08-26 16:10:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:48,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:48,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 164 [2023-08-26 16:10:48,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 16:10:48,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:48,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 164 [2023-08-26 16:10:48,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:48,475 INFO L124 PetriNetUnfolderBase]: 37/64 cut-off events. [2023-08-26 16:10:48,475 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 16:10:48,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 64 events. 37/64 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 111 event pairs, 17 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 132. Up to 64 conditions per place. [2023-08-26 16:10:48,476 INFO L140 encePairwiseOnDemand]: 161/164 looper letters, 14 selfloop transitions, 1 changer transitions 0/15 dead transitions. [2023-08-26 16:10:48,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 15 transitions, 66 flow [2023-08-26 16:10:48,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:48,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2023-08-26 16:10:48,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40040650406504064 [2023-08-26 16:10:48,478 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 197 transitions. [2023-08-26 16:10:48,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 197 transitions. [2023-08-26 16:10:48,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:48,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 197 transitions. [2023-08-26 16:10:48,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 16:10:48,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,481 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,482 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 40 flow. Second operand 3 states and 197 transitions. [2023-08-26 16:10:48,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 15 transitions, 66 flow [2023-08-26 16:10:48,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 15 transitions, 65 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:10:48,482 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 37 flow [2023-08-26 16:10:48,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=35, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=37, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2023-08-26 16:10:48,483 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 16:10:48,483 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 37 flow [2023-08-26 16:10:48,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 16:10:48,484 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:48,484 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:10:48,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 16:10:48,484 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:48,485 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:48,485 INFO L85 PathProgramCache]: Analyzing trace with hash 301993336, now seen corresponding path program 1 times [2023-08-26 16:10:48,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:48,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579484360] [2023-08-26 16:10:48,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:48,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:48,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:48,576 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 16:10:48,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:48,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579484360] [2023-08-26 16:10:48,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579484360] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:48,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:48,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 16:10:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745604739] [2023-08-26 16:10:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:10:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:48,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:10:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:10:48,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 164 [2023-08-26 16:10:48,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 37 flow. Second operand has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 16:10:48,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:48,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 164 [2023-08-26 16:10:48,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:48,605 INFO L124 PetriNetUnfolderBase]: 29/52 cut-off events. [2023-08-26 16:10:48,605 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 16:10:48,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 52 events. 29/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 77 event pairs, 13 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 109. Up to 52 conditions per place. [2023-08-26 16:10:48,606 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 13 selfloop transitions, 1 changer transitions 0/14 dead transitions. [2023-08-26 16:10:48,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 14 transitions, 63 flow [2023-08-26 16:10:48,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:48,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2023-08-26 16:10:48,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36585365853658536 [2023-08-26 16:10:48,608 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 180 transitions. [2023-08-26 16:10:48,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 180 transitions. [2023-08-26 16:10:48,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:48,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 180 transitions. [2023-08-26 16:10:48,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.0) internal successors, (180), 3 states have internal predecessors, (180), 0 states have call successors, (0), 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 16:10:48,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,611 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,611 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 37 flow. Second operand 3 states and 180 transitions. [2023-08-26 16:10:48,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 14 transitions, 63 flow [2023-08-26 16:10:48,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 14 transitions, 62 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:10:48,612 INFO L231 Difference]: Finished difference. Result has 20 places, 14 transitions, 36 flow [2023-08-26 16:10:48,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=14, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=36, PETRI_PLACES=20, PETRI_TRANSITIONS=14} [2023-08-26 16:10:48,613 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 16:10:48,613 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 14 transitions, 36 flow [2023-08-26 16:10:48,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.25) internal successors, (225), 4 states have internal predecessors, (225), 0 states have call successors, (0), 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 16:10:48,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:48,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 16:10:48,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 16:10:48,614 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:48,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:48,614 INFO L85 PathProgramCache]: Analyzing trace with hash 301993337, now seen corresponding path program 1 times [2023-08-26 16:10:48,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:48,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967195940] [2023-08-26 16:10:48,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:48,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:48,716 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 16:10:48,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:48,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967195940] [2023-08-26 16:10:48,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967195940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:48,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:48,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 16:10:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015201280] [2023-08-26 16:10:48,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:48,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:10:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:48,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:10:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:10:48,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 164 [2023-08-26 16:10:48,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 14 transitions, 36 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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 16:10:48,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:48,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 164 [2023-08-26 16:10:48,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:48,745 INFO L124 PetriNetUnfolderBase]: 21/40 cut-off events. [2023-08-26 16:10:48,746 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 16:10:48,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 40 events. 21/40 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 45 event pairs, 9 based on Foata normal form. 0/28 useless extension candidates. Maximal degree in co-relation 86. Up to 40 conditions per place. [2023-08-26 16:10:48,747 INFO L140 encePairwiseOnDemand]: 162/164 looper letters, 12 selfloop transitions, 1 changer transitions 0/13 dead transitions. [2023-08-26 16:10:48,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 13 transitions, 60 flow [2023-08-26 16:10:48,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2023-08-26 16:10:48,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3699186991869919 [2023-08-26 16:10:48,752 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 182 transitions. [2023-08-26 16:10:48,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 182 transitions. [2023-08-26 16:10:48,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:48,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 182 transitions. [2023-08-26 16:10:48,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 16:10:48,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,755 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:48,755 INFO L175 Difference]: Start difference. First operand has 20 places, 14 transitions, 36 flow. Second operand 3 states and 182 transitions. [2023-08-26 16:10:48,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 13 transitions, 60 flow [2023-08-26 16:10:48,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 13 transitions, 59 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:10:48,756 INFO L231 Difference]: Finished difference. Result has 20 places, 13 transitions, 35 flow [2023-08-26 16:10:48,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=33, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=35, PETRI_PLACES=20, PETRI_TRANSITIONS=13} [2023-08-26 16:10:48,756 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -6 predicate places. [2023-08-26 16:10:48,757 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 13 transitions, 35 flow [2023-08-26 16:10:48,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 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 16:10:48,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:48,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:48,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 16:10:48,757 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:48,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash -682426354, now seen corresponding path program 1 times [2023-08-26 16:10:48,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:48,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387871298] [2023-08-26 16:10:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:48,949 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 16:10:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387871298] [2023-08-26 16:10:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387871298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:48,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:48,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 16:10:48,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216691976] [2023-08-26 16:10:48,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:48,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 16:10:48,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:48,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 16:10:48,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 16:10:48,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 164 [2023-08-26 16:10:48,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 13 transitions, 35 flow. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 16:10:48,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:48,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 164 [2023-08-26 16:10:48,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:49,007 INFO L124 PetriNetUnfolderBase]: 41/77 cut-off events. [2023-08-26 16:10:49,007 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 16:10:49,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 77 events. 41/77 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 167 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 163. Up to 51 conditions per place. [2023-08-26 16:10:49,009 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2023-08-26 16:10:49,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 23 transitions, 104 flow [2023-08-26 16:10:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 16:10:49,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 16:10:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 219 transitions. [2023-08-26 16:10:49,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4451219512195122 [2023-08-26 16:10:49,011 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 219 transitions. [2023-08-26 16:10:49,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 219 transitions. [2023-08-26 16:10:49,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:49,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 219 transitions. [2023-08-26 16:10:49,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 73.0) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 16:10:49,014 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:49,015 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 164.0) internal successors, (656), 4 states have internal predecessors, (656), 0 states have call successors, (0), 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 16:10:49,015 INFO L175 Difference]: Start difference. First operand has 20 places, 13 transitions, 35 flow. Second operand 3 states and 219 transitions. [2023-08-26 16:10:49,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 23 transitions, 104 flow [2023-08-26 16:10:49,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 23 transitions, 103 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:10:49,017 INFO L231 Difference]: Finished difference. Result has 22 places, 15 transitions, 53 flow [2023-08-26 16:10:49,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=22, PETRI_TRANSITIONS=15} [2023-08-26 16:10:49,019 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -4 predicate places. [2023-08-26 16:10:49,022 INFO L495 AbstractCegarLoop]: Abstraction has has 22 places, 15 transitions, 53 flow [2023-08-26 16:10:49,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 3 states have internal predecessors, (206), 0 states have call successors, (0), 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 16:10:49,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:49,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:49,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 16:10:49,024 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:49,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:49,025 INFO L85 PathProgramCache]: Analyzing trace with hash -258027523, now seen corresponding path program 1 times [2023-08-26 16:10:49,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:49,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436441474] [2023-08-26 16:10:49,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:49,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:49,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:49,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:49,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436441474] [2023-08-26 16:10:49,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436441474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:49,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:49,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:49,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221660835] [2023-08-26 16:10:49,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:49,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:10:49,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:49,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:10:49,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:10:49,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 16:10:49,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 15 transitions, 53 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 16:10:49,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:49,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 16:10:49,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:49,222 INFO L124 PetriNetUnfolderBase]: 35/71 cut-off events. [2023-08-26 16:10:49,222 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 16:10:49,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 71 events. 35/71 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 157 event pairs, 6 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 177. Up to 45 conditions per place. [2023-08-26 16:10:49,225 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 15 selfloop transitions, 3 changer transitions 10/28 dead transitions. [2023-08-26 16:10:49,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 28 transitions, 139 flow [2023-08-26 16:10:49,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 16:10:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 16:10:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2023-08-26 16:10:49,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4298780487804878 [2023-08-26 16:10:49,227 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 282 transitions. [2023-08-26 16:10:49,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 282 transitions. [2023-08-26 16:10:49,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:49,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 282 transitions. [2023-08-26 16:10:49,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 0 states have call successors, (0), 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 16:10:49,230 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 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 16:10:49,230 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 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 16:10:49,230 INFO L175 Difference]: Start difference. First operand has 22 places, 15 transitions, 53 flow. Second operand 4 states and 282 transitions. [2023-08-26 16:10:49,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 28 transitions, 139 flow [2023-08-26 16:10:49,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 28 transitions, 136 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 16:10:49,232 INFO L231 Difference]: Finished difference. Result has 25 places, 15 transitions, 63 flow [2023-08-26 16:10:49,232 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=25, PETRI_TRANSITIONS=15} [2023-08-26 16:10:49,234 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-26 16:10:49,237 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 15 transitions, 63 flow [2023-08-26 16:10:49,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 16:10:49,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:49,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:49,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 16:10:49,238 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:49,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 633309805, now seen corresponding path program 2 times [2023-08-26 16:10:49,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:49,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208316160] [2023-08-26 16:10:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:49,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:49,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208316160] [2023-08-26 16:10:49,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208316160] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:10:49,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986073191] [2023-08-26 16:10:49,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 16:10:49,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:10:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:49,364 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 16:10:49,397 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 16:10:49,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 16:10:49,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:10:49,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 16:10:49,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:10:49,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:49,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:10:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:49,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986073191] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:10:49,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:10:49,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 16:10:49,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5725154] [2023-08-26 16:10:49,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:10:49,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 16:10:49,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:49,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 16:10:49,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 16:10:49,656 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 16:10:49,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 15 transitions, 63 flow. Second operand has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 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 16:10:49,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:49,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 16:10:49,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:49,763 INFO L124 PetriNetUnfolderBase]: 34/63 cut-off events. [2023-08-26 16:10:49,763 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-26 16:10:49,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 63 events. 34/63 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 110 event pairs, 4 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 189. Up to 39 conditions per place. [2023-08-26 16:10:49,764 INFO L140 encePairwiseOnDemand]: 159/164 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-08-26 16:10:49,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 28 transitions, 156 flow [2023-08-26 16:10:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 16:10:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 16:10:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 345 transitions. [2023-08-26 16:10:49,766 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42073170731707316 [2023-08-26 16:10:49,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 345 transitions. [2023-08-26 16:10:49,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 345 transitions. [2023-08-26 16:10:49,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:49,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 345 transitions. [2023-08-26 16:10:49,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 69.0) internal successors, (345), 5 states have internal predecessors, (345), 0 states have call successors, (0), 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 16:10:49,769 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 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 16:10:49,769 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 164.0) internal successors, (984), 6 states have internal predecessors, (984), 0 states have call successors, (0), 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 16:10:49,769 INFO L175 Difference]: Start difference. First operand has 25 places, 15 transitions, 63 flow. Second operand 5 states and 345 transitions. [2023-08-26 16:10:49,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 28 transitions, 156 flow [2023-08-26 16:10:49,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 148 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 16:10:49,770 INFO L231 Difference]: Finished difference. Result has 28 places, 18 transitions, 92 flow [2023-08-26 16:10:49,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=28, PETRI_TRANSITIONS=18} [2023-08-26 16:10:49,773 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-08-26 16:10:49,773 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 18 transitions, 92 flow [2023-08-26 16:10:49,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 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 16:10:49,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:49,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:49,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-26 16:10:49,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:10:49,981 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:49,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash -539296094, now seen corresponding path program 1 times [2023-08-26 16:10:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174552272] [2023-08-26 16:10:49,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:50,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:50,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:10:50,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:50,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174552272] [2023-08-26 16:10:50,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174552272] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 16:10:50,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 16:10:50,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 16:10:50,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363764174] [2023-08-26 16:10:50,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 16:10:50,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 16:10:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:10:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 16:10:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 16:10:50,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 16:10:50,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 18 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 16:10:50,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:10:50,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 16:10:50,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:10:50,161 INFO L124 PetriNetUnfolderBase]: 40/73 cut-off events. [2023-08-26 16:10:50,162 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-26 16:10:50,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 73 events. 40/73 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 133 event pairs, 4 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 264. Up to 61 conditions per place. [2023-08-26 16:10:50,163 INFO L140 encePairwiseOnDemand]: 160/164 looper letters, 21 selfloop transitions, 4 changer transitions 0/25 dead transitions. [2023-08-26 16:10:50,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 25 transitions, 169 flow [2023-08-26 16:10:50,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 16:10:50,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 16:10:50,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 275 transitions. [2023-08-26 16:10:50,164 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192073170731707 [2023-08-26 16:10:50,164 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 275 transitions. [2023-08-26 16:10:50,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 275 transitions. [2023-08-26 16:10:50,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:10:50,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 275 transitions. [2023-08-26 16:10:50,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 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 16:10:50,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 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 16:10:50,167 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 164.0) internal successors, (820), 5 states have internal predecessors, (820), 0 states have call successors, (0), 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 16:10:50,167 INFO L175 Difference]: Start difference. First operand has 28 places, 18 transitions, 92 flow. Second operand 4 states and 275 transitions. [2023-08-26 16:10:50,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 25 transitions, 169 flow [2023-08-26 16:10:50,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 162 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 16:10:50,169 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 103 flow [2023-08-26 16:10:50,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=103, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-08-26 16:10:50,170 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2023-08-26 16:10:50,170 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 103 flow [2023-08-26 16:10:50,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 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 16:10:50,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:10:50,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:10:50,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 16:10:50,171 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:10:50,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:10:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1071375987, now seen corresponding path program 1 times [2023-08-26 16:10:50,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:10:50,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379764277] [2023-08-26 16:10:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:50,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:10:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:50,537 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 16:10:50,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:10:50,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379764277] [2023-08-26 16:10:50,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379764277] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:10:50,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823444137] [2023-08-26 16:10:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:10:50,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:10:50,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:10:50,540 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 16:10:50,551 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 16:10:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:10:51,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:10:51,512 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:11:10,321 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 16:11:10,322 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:11:17,832 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 16:11:17,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823444137] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:11:17,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:11:17,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-26 16:11:17,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238887596] [2023-08-26 16:11:17,833 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:11:17,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 16:11:17,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:11:17,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 16:11:17,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=145, Unknown=7, NotChecked=0, Total=210 [2023-08-26 16:11:17,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 16:11:17,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 103 flow. Second operand has 15 states, 15 states have (on average 65.0) internal successors, (975), 15 states have internal predecessors, (975), 0 states have call successors, (0), 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 16:11:17,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:11:17,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 16:11:17,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:11:31,677 WARN L234 SmtUtils]: Spent 9.85s on a formula simplification. DAG size of input: 51 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:11:33,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:11:35,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:11:37,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:11:45,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:11:55,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:11:57,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:11:59,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:12:03,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:12:09,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:12:11,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:12:13,586 INFO L124 PetriNetUnfolderBase]: 154/291 cut-off events. [2023-08-26 16:12:13,586 INFO L125 PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES. [2023-08-26 16:12:13,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1081 conditions, 291 events. 154/291 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1104 event pairs, 4 based on Foata normal form. 7/298 useless extension candidates. Maximal degree in co-relation 1071. Up to 97 conditions per place. [2023-08-26 16:12:13,588 INFO L140 encePairwiseOnDemand]: 154/164 looper letters, 56 selfloop transitions, 27 changer transitions 21/104 dead transitions. [2023-08-26 16:12:13,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 104 transitions, 668 flow [2023-08-26 16:12:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-26 16:12:13,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-26 16:12:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1047 transitions. [2023-08-26 16:12:13,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42560975609756097 [2023-08-26 16:12:13,593 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1047 transitions. [2023-08-26 16:12:13,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1047 transitions. [2023-08-26 16:12:13,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:12:13,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1047 transitions. [2023-08-26 16:12:13,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 69.8) internal successors, (1047), 15 states have internal predecessors, (1047), 0 states have call successors, (0), 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 16:12:13,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 164.0) internal successors, (2624), 16 states have internal predecessors, (2624), 0 states have call successors, (0), 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 16:12:13,601 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 164.0) internal successors, (2624), 16 states have internal predecessors, (2624), 0 states have call successors, (0), 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 16:12:13,602 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 103 flow. Second operand 15 states and 1047 transitions. [2023-08-26 16:12:13,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 104 transitions, 668 flow [2023-08-26 16:12:13,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 104 transitions, 657 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-26 16:12:13,605 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 385 flow [2023-08-26 16:12:13,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=385, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-26 16:12:13,606 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 28 predicate places. [2023-08-26 16:12:13,606 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 385 flow [2023-08-26 16:12:13,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 65.0) internal successors, (975), 15 states have internal predecessors, (975), 0 states have call successors, (0), 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 16:12:13,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:12:13,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:12:13,615 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 16:12:13,812 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,SelfDestructingSolverStorable9 [2023-08-26 16:12:13,813 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:12:13,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:12:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1491328013, now seen corresponding path program 2 times [2023-08-26 16:12:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:12:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896751805] [2023-08-26 16:12:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:12:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:12:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:12:14,144 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 16:12:14,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:12:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896751805] [2023-08-26 16:12:14,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896751805] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:12:14,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875628762] [2023-08-26 16:12:14,145 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 16:12:14,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:12:14,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:12:14,149 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 16:12:14,153 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 16:12:14,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 16:12:14,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:12:14,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 16:12:14,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:12:28,028 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 16:12:28,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:12:37,931 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 16:12:37,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875628762] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:12:37,932 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:12:37,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-08-26 16:12:37,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490311621] [2023-08-26 16:12:37,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:12:37,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 16:12:37,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:12:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 16:12:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=150, Unknown=8, NotChecked=0, Total=210 [2023-08-26 16:12:37,934 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 16:12:37,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 385 flow. Second operand has 15 states, 15 states have (on average 65.0) internal successors, (975), 15 states have internal predecessors, (975), 0 states have call successors, (0), 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 16:12:37,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:12:37,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 16:12:37,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:12:40,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:12:42,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:12:45,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:12:50,623 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x2~0 4294967296)) (.cse2 (div (* (- 1) c_~x2~0) 2)) (.cse0 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 .cse1) (= (+ c_~x1~0 .cse2 (* (div (* (- 1) .cse2) 4294967296) 4294967296)) (* 4294967296 (div c_~x1~0 4294967296))) (let ((.cse3 (+ .cse1 1))) (or (< (* (mod c_~x2~0 2147483648) 2) .cse3) (let ((.cse5 (* (div c_~x1~0 2147483648) 2147483648)) (.cse4 (+ (* (div c_~x2~0 2147483648) 2147483648) c_~x1~0))) (and (< .cse4 (+ .cse5 c_~x2~0 1)) (<= (+ .cse5 c_~x2~0) .cse4))) (< (* 2 (mod c_~x1~0 2147483648)) .cse3))) (< (mod (* .cse2 4294967295) 4294967296) .cse0))) is different from false [2023-08-26 16:12:59,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:00,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:02,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:04,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:08,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:16,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:19,332 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* 4294967296 (div c_~x1~0 4294967296))) (.cse5 (* (div c_~x2~0 4294967296) 4294967296)) (.cse1 (div (* (- 1) c_~x2~0) 2))) (and (= (mod c_~x2~0 2) 0) (< .cse0 c_~x1~0) (= (+ c_~x1~0 .cse1 (* (div (* (- 1) .cse1) 4294967296) 4294967296)) .cse0) (let ((.cse2 (+ (mod c_~x2~0 4294967296) 1))) (or (< (* (mod c_~x2~0 2147483648) 2) .cse2) (let ((.cse4 (* (div c_~x1~0 2147483648) 2147483648)) (.cse3 (+ (* (div c_~x2~0 2147483648) 2147483648) c_~x1~0))) (and (< .cse3 (+ .cse4 c_~x2~0 1)) (<= (+ .cse4 c_~x2~0) .cse3))) (< (* 2 (mod c_~x1~0 2147483648)) .cse2))) (<= (+ .cse0 c_~n~0 .cse5) (+ (* c_~x1~0 3) (* (div (+ c_~x2~0 (* (- 2) c_~x1~0)) 4294967296) 4294967296) (* 4294967296 (div c_~n~0 4294967296)))) (<= (+ .cse0 c_~x2~0) (+ (* c_~x1~0 2) (* (div (+ (* (- 1) c_~x1~0) 4294967295) 4294967296) 4294967296) .cse5)) (< (mod (* .cse1 4294967295) 4294967296) (mod c_~n~0 4294967296)))) is different from false [2023-08-26 16:13:22,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:25,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:27,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:29,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:32,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:13:32,133 INFO L124 PetriNetUnfolderBase]: 238/463 cut-off events. [2023-08-26 16:13:32,134 INFO L125 PetriNetUnfolderBase]: For 2180/2180 co-relation queries the response was YES. [2023-08-26 16:13:32,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 463 events. 238/463 cut-off events. For 2180/2180 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2059 event pairs, 28 based on Foata normal form. 5/468 useless extension candidates. Maximal degree in co-relation 2442. Up to 249 conditions per place. [2023-08-26 16:13:32,137 INFO L140 encePairwiseOnDemand]: 154/164 looper letters, 91 selfloop transitions, 38 changer transitions 14/143 dead transitions. [2023-08-26 16:13:32,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 143 transitions, 1361 flow [2023-08-26 16:13:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 16:13:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 16:13:32,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1316 transitions. [2023-08-26 16:13:32,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42233632862644416 [2023-08-26 16:13:32,142 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1316 transitions. [2023-08-26 16:13:32,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1316 transitions. [2023-08-26 16:13:32,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:13:32,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1316 transitions. [2023-08-26 16:13:32,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 69.26315789473684) internal successors, (1316), 19 states have internal predecessors, (1316), 0 states have call successors, (0), 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 16:13:32,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 164.0) internal successors, (3280), 20 states have internal predecessors, (3280), 0 states have call successors, (0), 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 16:13:32,150 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 164.0) internal successors, (3280), 20 states have internal predecessors, (3280), 0 states have call successors, (0), 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 16:13:32,150 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 385 flow. Second operand 19 states and 1316 transitions. [2023-08-26 16:13:32,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 143 transitions, 1361 flow [2023-08-26 16:13:32,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 143 transitions, 1140 flow, removed 109 selfloop flow, removed 4 redundant places. [2023-08-26 16:13:32,161 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 724 flow [2023-08-26 16:13:32,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=724, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2023-08-26 16:13:32,161 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 53 predicate places. [2023-08-26 16:13:32,161 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 724 flow [2023-08-26 16:13:32,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 65.0) internal successors, (975), 15 states have internal predecessors, (975), 0 states have call successors, (0), 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 16:13:32,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:13:32,162 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:13:32,173 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 16:13:32,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:13:32,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:13:32,368 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:13:32,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2088997148, now seen corresponding path program 3 times [2023-08-26 16:13:32,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:13:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723229845] [2023-08-26 16:13:32,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:13:32,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:13:32,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:13:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:13:32,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:13:32,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723229845] [2023-08-26 16:13:32,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723229845] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:13:32,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791796912] [2023-08-26 16:13:32,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 16:13:32,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:13:32,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:13:32,640 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 16:13:32,641 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 16:14:16,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 16:14:16,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:14:16,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 16:14:16,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:14:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:14:29,628 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:14:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:14:44,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791796912] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:14:44,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:14:44,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 15 [2023-08-26 16:14:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448992521] [2023-08-26 16:14:44,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:14:44,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 16:14:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:14:44,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 16:14:44,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=176, Unknown=8, NotChecked=0, Total=240 [2023-08-26 16:14:44,127 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 16:14:44,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 724 flow. Second operand has 16 states, 16 states have (on average 65.0625) internal successors, (1041), 16 states have internal predecessors, (1041), 0 states have call successors, (0), 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 16:14:44,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:14:44,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 16:14:44,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:14:54,940 WARN L234 SmtUtils]: Spent 6.16s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:14:57,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:14:59,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:01,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:04,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:06,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:11,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:18,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:20,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:22,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:24,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:26,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:28,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:30,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:45,702 WARN L234 SmtUtils]: Spent 12.11s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:15:46,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:49,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:51,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:53,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:15:54,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:16:47,200 WARN L234 SmtUtils]: Spent 37.97s on a formula simplification. DAG size of input: 56 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:16:49,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:16:51,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:16:53,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:16:55,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:22,695 WARN L234 SmtUtils]: Spent 12.10s on a formula simplification. DAG size of input: 50 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:17:24,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:26,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:28,387 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:30,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:32,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:34,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:36,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:39,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:17:41,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:04,803 WARN L234 SmtUtils]: Spent 16.29s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:18:21,940 WARN L234 SmtUtils]: Spent 11.76s on a formula simplification that was a NOOP. DAG size: 55 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:18:24,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:25,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:37,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:18:39,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:02,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:04,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:06,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:08,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:11,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:19:59,977 WARN L234 SmtUtils]: Spent 19.68s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:20:02,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:04,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:07,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:09,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:11,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:13,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:15,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:17,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:18,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:20,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:21,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:23,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:27,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:29,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:32,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:20:53,275 WARN L234 SmtUtils]: Spent 17.23s on a formula simplification. DAG size of input: 73 DAG size of output: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:21:06,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:08,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:30,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:32,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:34,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:37,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:39,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:41,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:42,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:46,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:47,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:50,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:21:52,753 INFO L124 PetriNetUnfolderBase]: 501/1030 cut-off events. [2023-08-26 16:21:52,753 INFO L125 PetriNetUnfolderBase]: For 12241/12241 co-relation queries the response was YES. [2023-08-26 16:21:52,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6597 conditions, 1030 events. 501/1030 cut-off events. For 12241/12241 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6160 event pairs, 10 based on Foata normal form. 38/1068 useless extension candidates. Maximal degree in co-relation 6564. Up to 408 conditions per place. [2023-08-26 16:21:52,762 INFO L140 encePairwiseOnDemand]: 155/164 looper letters, 166 selfloop transitions, 115 changer transitions 10/291 dead transitions. [2023-08-26 16:21:52,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 291 transitions, 3348 flow [2023-08-26 16:21:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-08-26 16:21:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-08-26 16:21:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2350 transitions. [2023-08-26 16:21:52,770 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4214490674318508 [2023-08-26 16:21:52,770 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 2350 transitions. [2023-08-26 16:21:52,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 2350 transitions. [2023-08-26 16:21:52,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 16:21:52,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2350 transitions. [2023-08-26 16:21:52,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 69.11764705882354) internal successors, (2350), 34 states have internal predecessors, (2350), 0 states have call successors, (0), 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 16:21:52,811 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 164.0) internal successors, (5740), 35 states have internal predecessors, (5740), 0 states have call successors, (0), 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 16:21:52,812 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 164.0) internal successors, (5740), 35 states have internal predecessors, (5740), 0 states have call successors, (0), 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 16:21:52,812 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 724 flow. Second operand 34 states and 2350 transitions. [2023-08-26 16:21:52,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 291 transitions, 3348 flow [2023-08-26 16:21:52,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 291 transitions, 3054 flow, removed 144 selfloop flow, removed 3 redundant places. [2023-08-26 16:21:52,843 INFO L231 Difference]: Finished difference. Result has 118 places, 174 transitions, 2054 flow [2023-08-26 16:21:52,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=164, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=2054, PETRI_PLACES=118, PETRI_TRANSITIONS=174} [2023-08-26 16:21:52,844 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 92 predicate places. [2023-08-26 16:21:52,844 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 174 transitions, 2054 flow [2023-08-26 16:21:52,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 65.0625) internal successors, (1041), 16 states have internal predecessors, (1041), 0 states have call successors, (0), 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 16:21:52,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 16:21:52,845 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:21:52,856 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 16:21:53,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:21:53,053 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2023-08-26 16:21:53,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 16:21:53,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1423351939, now seen corresponding path program 4 times [2023-08-26 16:21:53,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 16:21:53,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542039937] [2023-08-26 16:21:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 16:21:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 16:21:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 16:21:53,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 16:21:53,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 16:21:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542039937] [2023-08-26 16:21:53,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542039937] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 16:21:53,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738809452] [2023-08-26 16:21:53,238 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 16:21:53,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 16:21:53,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 16:21:53,240 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 16:21:53,245 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 16:22:05,985 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 16:22:05,985 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 16:22:05,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 16:22:05,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 16:22:40,136 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse1 (div (* (- 1) c_~x2~0) 2)) (.cse0 (mod c_~n~0 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 (mod c_~x1~0 4294967296)) (= (mod .cse1 2) 0) (< .cse2 .cse0) (= (mod c_~x1~0 2) 0) (= .cse2 (mod (div (* (- 1) .cse1) 2) 4294967296)) (< (mod (* .cse1 4294967295) 4294967296) .cse0))) is different from false [2023-08-26 16:23:06,283 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (div c_~x2~0 2))) (let ((.cse1 (mod c_~n~0 4294967296)) (.cse2 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse0 (div (* (- 1) .cse3) 2))) (and (< (mod (* 4294967295 .cse0) 4294967296) .cse1) (= (mod c_~x2~0 2) 0) (<= .cse1 (mod c_~x1~0 4294967296)) (< .cse2 .cse1) (= (mod c_~x1~0 2) 0) (= (mod .cse3 2) 0) (= .cse2 (mod (div (* (- 1) .cse0) 2) 4294967296)) (= (mod .cse0 2) 0)))) is different from false [2023-08-26 16:23:35,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-26 16:23:35,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 16:23:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 16:23:56,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738809452] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 16:23:56,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 16:23:56,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2023-08-26 16:23:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008253597] [2023-08-26 16:23:56,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 16:23:56,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-26 16:23:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 16:23:56,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-26 16:23:56,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=180, Unknown=16, NotChecked=58, Total=306 [2023-08-26 16:23:56,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 164 [2023-08-26 16:23:56,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 174 transitions, 2054 flow. Second operand has 18 states, 18 states have (on average 65.38888888888889) internal successors, (1177), 18 states have internal predecessors, (1177), 0 states have call successors, (0), 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 16:23:56,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 16:23:56,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 164 [2023-08-26 16:23:56,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 16:24:06,146 WARN L234 SmtUtils]: Spent 9.56s on a formula simplification. DAG size of input: 38 DAG size of output: 9 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 16:24:08,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:10,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:12,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:14,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:16,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:18,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:20,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:22,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:25,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:27,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:29,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:31,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:47,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:49,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:52,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:54,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:24:58,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:00,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:02,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 16:25:04,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-26 16:25:21,688 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 16:25:21,688 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 16:25:21,747 WARN L266 SmtUtils]: Removed 4 from assertion stack [2023-08-26 16:25:21,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 16:25:21,748 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2023-08-26 16:25:21,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-26 16:25:21,948 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,SelfDestructingSolverStorable12 [2023-08-26 16:25:21,949 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 32 for 4058ms.. [2023-08-26 16:25:21,950 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2023-08-26 16:25:21,950 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2023-08-26 16:25:21,950 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2023-08-26 16:25:21,950 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2023-08-26 16:25:21,951 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2023-08-26 16:25:21,951 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2023-08-26 16:25:21,951 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2023-08-26 16:25:21,951 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2023-08-26 16:25:21,951 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2023-08-26 16:25:21,951 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2023-08-26 16:25:21,951 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 16:25:21,954 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 16:25:21,954 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 16:25:21,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 04:25:21 BasicIcfg [2023-08-26 16:25:21,956 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 16:25:21,957 INFO L158 Benchmark]: Toolchain (without parser) took 877627.06ms. Allocated memory was 339.7MB in the beginning and 408.9MB in the end (delta: 69.2MB). Free memory was 316.4MB in the beginning and 374.3MB in the end (delta: -57.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.0GB. [2023-08-26 16:25:21,957 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 339.7MB. Free memory is still 316.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:25:21,957 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.74ms. Allocated memory is still 339.7MB. Free memory was 316.0MB in the beginning and 305.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 16:25:21,957 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.14ms. Allocated memory is still 339.7MB. Free memory was 305.6MB in the beginning and 304.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 16:25:21,957 INFO L158 Benchmark]: Boogie Preprocessor took 31.69ms. Allocated memory is still 339.7MB. Free memory was 304.0MB in the beginning and 302.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:25:21,957 INFO L158 Benchmark]: RCFGBuilder took 350.57ms. Allocated memory is still 339.7MB. Free memory was 302.8MB in the beginning and 289.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-26 16:25:21,958 INFO L158 Benchmark]: TraceAbstraction took 876972.68ms. Allocated memory was 339.7MB in the beginning and 408.9MB in the end (delta: 69.2MB). Free memory was 288.9MB in the beginning and 374.3MB in the end (delta: -85.3MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 16:25:21,959 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.15ms. Allocated memory is still 339.7MB. Free memory is still 316.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 220.74ms. Allocated memory is still 339.7MB. Free memory was 316.0MB in the beginning and 305.6MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.14ms. Allocated memory is still 339.7MB. Free memory was 305.6MB in the beginning and 304.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.69ms. Allocated memory is still 339.7MB. Free memory was 304.0MB in the beginning and 302.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 350.57ms. Allocated memory is still 339.7MB. Free memory was 302.8MB in the beginning and 289.4MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 876972.68ms. Allocated memory was 339.7MB in the beginning and 408.9MB in the end (delta: 69.2MB). Free memory was 288.9MB in the beginning and 374.3MB in the end (delta: -85.3MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.7s, 76 PlacesBefore, 26 PlacesAfterwards, 75 TransitionsBefore, 21 TransitionsAfterwards, 348 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 21 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 78 TotalNumberOfCompositions, 457 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 457, independent: 457, independent conditional: 0, independent unconditional: 457, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 188, independent: 188, independent conditional: 0, independent unconditional: 188, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 457, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 188, unknown conditional: 0, unknown unconditional: 188] , Statistics on independence cache: Total cache size (in pairs): 21, Positive cache size: 21, Positive conditional cache size: 0, Positive unconditional cache size: 21, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 32 for 4058ms.. - 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 32 for 4058ms.. - 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 32 for 4058ms.. - 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 32 for 4058ms.. - 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 32 for 4058ms.. - 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 32 for 4058ms.. - 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 32 for 4058ms.. - 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 32 for 4058ms.. - 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 32 for 4058ms.. - TimeoutResultAtElement [Line: 64]: 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 32 for 4058ms.. - TimeoutResultAtElement [Line: 65]: 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 32 for 4058ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 93 locations, 11 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: 876.9s, OverallIterations: 13, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 624.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 94 mSolverCounterUnknown, 432 SdHoareTripleChecker+Valid, 259.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 257.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 150 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1997 IncrementalHoareTripleChecker+Invalid, 2319 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 0 mSDtfsCounter, 1997 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 82 SyntacticMatches, 11 SemanticMatches, 115 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 450.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2054occurred in iteration=12, InterpolantAutomatonStates: 98, 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.1s SsaConstructionTime, 58.2s SatisfiabilityAnalysisTime, 189.6s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 230 ConstructedInterpolants, 0 QuantifiedInterpolants, 6628 SizeOfPredicates, 18 NumberOfNonLiveVariables, 611 ConjunctsInSsa, 83 ConjunctsInUnsatCore, 23 InterpolantComputations, 8 PerfectInterpolantSequences, 9/50 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