/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 PROGRAM_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/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:56:18,736 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:56:18,803 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 18:56:18,809 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:56:18,810 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:56:18,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:56:18,840 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:56:18,841 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:56:18,841 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:56:18,841 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:56:18,842 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:56:18,842 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:56:18,842 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:56:18,843 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:56:18,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:56:18,843 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:56:18,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:56:18,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:56:18,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:56:18,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:56:18,845 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:56:18,849 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:56:18,849 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:56:18,850 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:56:18,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:56:18,853 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:56:18,855 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:56:18,855 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:56:18,856 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:56:18,856 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:56:18,856 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:56:18,856 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:56:18,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:56:18,857 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:56:18,857 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:56:18,858 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 -> PROGRAM_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 18:56:19,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:56:19,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:56:19,206 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:56:19,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:56:19,208 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:56:19,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-08-26 18:56:20,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:56:20,822 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:56:20,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-08-26 18:56:20,844 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d197cd61d/62124abed39949f6886f90dc3fabb2be/FLAG80efec36d [2023-08-26 18:56:20,860 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d197cd61d/62124abed39949f6886f90dc3fabb2be [2023-08-26 18:56:20,862 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:56:20,863 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:56:20,864 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:56:20,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:56:20,867 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:56:20,867 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:56:20" (1/1) ... [2023-08-26 18:56:20,868 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@335ce31e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:20, skipping insertion in model container [2023-08-26 18:56:20,868 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:56:20" (1/1) ... [2023-08-26 18:56:20,939 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:56:21,326 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:56:21,342 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:56:21,368 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 18:56:21,370 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-26 18:56:21,393 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-26 18:56:21,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:56:21,478 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:56:21,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21 WrapperNode [2023-08-26 18:56:21,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:56:21,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:56:21,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:56:21,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:56:21,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,557 INFO L138 Inliner]: procedures = 271, calls = 32, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 204 [2023-08-26 18:56:21,557 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:56:21,559 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:56:21,559 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:56:21,559 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:56:21,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,581 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,593 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:56:21,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:56:21,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:56:21,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:56:21,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (1/1) ... [2023-08-26 18:56:21,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:56:21,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:56:21,655 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 18:56:21,677 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 18:56:21,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:56:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:56:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 18:56:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:56:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-26 18:56:21,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:56:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-26 18:56:21,692 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-26 18:56:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:56:21,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:56:21,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:56:21,694 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 18:56:21,870 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:56:21,872 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:56:22,192 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:56:22,199 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:56:22,199 INFO L302 CfgBuilder]: Removed 25 assume(true) statements. [2023-08-26 18:56:22,201 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:56:22 BoogieIcfgContainer [2023-08-26 18:56:22,201 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:56:22,203 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:56:22,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:56:22,206 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:56:22,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:56:20" (1/3) ... [2023-08-26 18:56:22,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef8f729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:56:22, skipping insertion in model container [2023-08-26 18:56:22,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:56:21" (2/3) ... [2023-08-26 18:56:22,207 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ef8f729 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:56:22, skipping insertion in model container [2023-08-26 18:56:22,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:56:22" (3/3) ... [2023-08-26 18:56:22,208 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2023-08-26 18:56:22,221 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:56:22,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2023-08-26 18:56:22,221 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:56:22,293 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-26 18:56:22,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 227 transitions, 462 flow [2023-08-26 18:56:22,445 INFO L124 PetriNetUnfolderBase]: 52/328 cut-off events. [2023-08-26 18:56:22,445 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:56:22,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 328 events. 52/328 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1360 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2023-08-26 18:56:22,456 INFO L82 GeneralOperation]: Start removeDead. Operand has 195 places, 227 transitions, 462 flow [2023-08-26 18:56:22,464 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 227 transitions, 462 flow [2023-08-26 18:56:22,467 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:56:22,481 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 195 places, 227 transitions, 462 flow [2023-08-26 18:56:22,489 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 195 places, 227 transitions, 462 flow [2023-08-26 18:56:22,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 195 places, 227 transitions, 462 flow [2023-08-26 18:56:22,551 INFO L124 PetriNetUnfolderBase]: 52/328 cut-off events. [2023-08-26 18:56:22,552 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:56:22,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 328 events. 52/328 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1360 event pairs, 0 based on Foata normal form. 0/232 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2023-08-26 18:56:22,567 INFO L119 LiptonReduction]: Number of co-enabled transitions 17762 [2023-08-26 18:56:26,292 INFO L134 LiptonReduction]: Checked pairs total: 32876 [2023-08-26 18:56:26,293 INFO L136 LiptonReduction]: Total number of compositions: 213 [2023-08-26 18:56:26,305 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:56:26,310 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;@6f649e39, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:56:26,310 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2023-08-26 18:56:26,313 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:56:26,313 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2023-08-26 18:56:26,313 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:56:26,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:26,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:56:26,314 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:26,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:26,318 INFO L85 PathProgramCache]: Analyzing trace with hash 916720, now seen corresponding path program 1 times [2023-08-26 18:56:26,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:26,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603492845] [2023-08-26 18:56:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:26,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:26,524 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 18:56:26,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:26,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603492845] [2023-08-26 18:56:26,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603492845] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:56:26,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:56:26,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:56:26,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257565339] [2023-08-26 18:56:26,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:56:26,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:56:26,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:26,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:56:26,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:56:26,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 440 [2023-08-26 18:56:26,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 96 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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 18:56:26,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:26,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 440 [2023-08-26 18:56:26,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:26,857 INFO L124 PetriNetUnfolderBase]: 663/1469 cut-off events. [2023-08-26 18:56:26,857 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:56:26,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2730 conditions, 1469 events. 663/1469 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9422 event pairs, 560 based on Foata normal form. 102/1017 useless extension candidates. Maximal degree in co-relation 2645. Up to 1253 conditions per place. [2023-08-26 18:56:26,867 INFO L140 encePairwiseOnDemand]: 410/440 looper letters, 55 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-08-26 18:56:26,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 262 flow [2023-08-26 18:56:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:56:26,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:56:26,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 643 transitions. [2023-08-26 18:56:26,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4871212121212121 [2023-08-26 18:56:26,885 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 643 transitions. [2023-08-26 18:56:26,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 643 transitions. [2023-08-26 18:56:26,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:26,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 643 transitions. [2023-08-26 18:56:26,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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 18:56:26,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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 18:56:26,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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 18:56:26,906 INFO L175 Difference]: Start difference. First operand has 72 places, 96 transitions, 200 flow. Second operand 3 states and 643 transitions. [2023-08-26 18:56:26,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 262 flow [2023-08-26 18:56:26,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 262 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 18:56:26,914 INFO L231 Difference]: Finished difference. Result has 69 places, 70 transitions, 158 flow [2023-08-26 18:56:26,916 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=69, PETRI_TRANSITIONS=70} [2023-08-26 18:56:26,921 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-08-26 18:56:26,922 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 70 transitions, 158 flow [2023-08-26 18:56:26,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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 18:56:26,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:26,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-26 18:56:26,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:56:26,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:26,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:26,925 INFO L85 PathProgramCache]: Analyzing trace with hash 28408047, now seen corresponding path program 1 times [2023-08-26 18:56:26,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835250081] [2023-08-26 18:56:26,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:26,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:27,012 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 18:56:27,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835250081] [2023-08-26 18:56:27,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835250081] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:56:27,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516560500] [2023-08-26 18:56:27,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:27,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:56:27,017 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 18:56:27,025 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 18:56:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:27,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-26 18:56:27,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:56:27,150 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 18:56:27,150 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:56:27,171 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 18:56:27,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516560500] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:56:27,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:56:27,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-26 18:56:27,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832659018] [2023-08-26 18:56:27,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:56:27,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:56:27,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:27,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:56:27,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:56:27,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 440 [2023-08-26 18:56:27,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 70 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 187.28571428571428) internal successors, (1311), 7 states have internal predecessors, (1311), 0 states have call successors, (0), 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 18:56:27,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:27,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 440 [2023-08-26 18:56:27,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:27,474 INFO L124 PetriNetUnfolderBase]: 663/1472 cut-off events. [2023-08-26 18:56:27,474 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-26 18:56:27,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2746 conditions, 1472 events. 663/1472 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9437 event pairs, 560 based on Foata normal form. 0/918 useless extension candidates. Maximal degree in co-relation 2734. Up to 1253 conditions per place. [2023-08-26 18:56:27,483 INFO L140 encePairwiseOnDemand]: 437/440 looper letters, 55 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2023-08-26 18:56:27,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 290 flow [2023-08-26 18:56:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:56:27,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:56:27,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1179 transitions. [2023-08-26 18:56:27,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4465909090909091 [2023-08-26 18:56:27,487 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1179 transitions. [2023-08-26 18:56:27,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1179 transitions. [2023-08-26 18:56:27,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:27,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1179 transitions. [2023-08-26 18:56:27,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 196.5) internal successors, (1179), 6 states have internal predecessors, (1179), 0 states have call successors, (0), 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 18:56:27,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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 18:56:27,499 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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 18:56:27,500 INFO L175 Difference]: Start difference. First operand has 69 places, 70 transitions, 158 flow. Second operand 6 states and 1179 transitions. [2023-08-26 18:56:27,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 290 flow [2023-08-26 18:56:27,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 73 transitions, 286 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:56:27,508 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 190 flow [2023-08-26 18:56:27,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=190, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-26 18:56:27,509 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2023-08-26 18:56:27,510 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 190 flow [2023-08-26 18:56:27,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 187.28571428571428) internal successors, (1311), 7 states have internal predecessors, (1311), 0 states have call successors, (0), 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 18:56:27,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:27,514 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 18:56:27,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 18:56:27,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:27,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:27,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash 185369776, now seen corresponding path program 2 times [2023-08-26 18:56:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:27,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54437649] [2023-08-26 18:56:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:27,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:27,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-26 18:56:27,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:27,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54437649] [2023-08-26 18:56:27,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54437649] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:56:27,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:56:27,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:56:27,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101975178] [2023-08-26 18:56:27,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:56:27,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:56:27,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:27,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:56:27,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:56:27,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 440 [2023-08-26 18:56:27,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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 18:56:27,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:27,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 440 [2023-08-26 18:56:27,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:28,070 INFO L124 PetriNetUnfolderBase]: 726/1493 cut-off events. [2023-08-26 18:56:28,071 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 18:56:28,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2910 conditions, 1493 events. 726/1493 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 9025 event pairs, 600 based on Foata normal form. 0/956 useless extension candidates. Maximal degree in co-relation 2876. Up to 1329 conditions per place. [2023-08-26 18:56:28,080 INFO L140 encePairwiseOnDemand]: 436/440 looper letters, 84 selfloop transitions, 2 changer transitions 1/96 dead transitions. [2023-08-26 18:56:28,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 96 transitions, 410 flow [2023-08-26 18:56:28,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:56:28,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:56:28,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2023-08-26 18:56:28,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4257575757575758 [2023-08-26 18:56:28,083 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 562 transitions. [2023-08-26 18:56:28,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 562 transitions. [2023-08-26 18:56:28,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:28,083 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 562 transitions. [2023-08-26 18:56:28,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 18:56:28,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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 18:56:28,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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 18:56:28,088 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 190 flow. Second operand 3 states and 562 transitions. [2023-08-26 18:56:28,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 96 transitions, 410 flow [2023-08-26 18:56:28,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 96 transitions, 396 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-26 18:56:28,092 INFO L231 Difference]: Finished difference. Result has 75 places, 71 transitions, 176 flow [2023-08-26 18:56:28,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=75, PETRI_TRANSITIONS=71} [2023-08-26 18:56:28,093 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2023-08-26 18:56:28,093 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 71 transitions, 176 flow [2023-08-26 18:56:28,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 0 states have call successors, (0), 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 18:56:28,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:28,093 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2023-08-26 18:56:28,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:56:28,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:28,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:28,094 INFO L85 PathProgramCache]: Analyzing trace with hash 185369775, now seen corresponding path program 1 times [2023-08-26 18:56:28,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:28,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960352944] [2023-08-26 18:56:28,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:28,218 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:56:28,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:28,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960352944] [2023-08-26 18:56:28,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960352944] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:56:28,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174598529] [2023-08-26 18:56:28,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:28,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:28,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:56:28,221 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 18:56:28,223 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 18:56:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:28,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-26 18:56:28,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:56:28,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:56:28,352 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:56:28,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 18:56:28,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174598529] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:56:28,397 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:56:28,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-26 18:56:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988259169] [2023-08-26 18:56:28,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:56:28,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 18:56:28,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:28,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 18:56:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-08-26 18:56:28,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 440 [2023-08-26 18:56:28,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 71 transitions, 176 flow. Second operand has 13 states, 13 states have (on average 187.15384615384616) internal successors, (2433), 13 states have internal predecessors, (2433), 0 states have call successors, (0), 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 18:56:28,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:28,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 440 [2023-08-26 18:56:28,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:28,599 INFO L124 PetriNetUnfolderBase]: 619/1378 cut-off events. [2023-08-26 18:56:28,599 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-26 18:56:28,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 1378 events. 619/1378 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8659 event pairs, 520 based on Foata normal form. 6/917 useless extension candidates. Maximal degree in co-relation 2562. Up to 1167 conditions per place. [2023-08-26 18:56:28,607 INFO L140 encePairwiseOnDemand]: 437/440 looper letters, 53 selfloop transitions, 11 changer transitions 0/77 dead transitions. [2023-08-26 18:56:28,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 77 transitions, 340 flow [2023-08-26 18:56:28,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:56:28,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:56:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2302 transitions. [2023-08-26 18:56:28,612 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4359848484848485 [2023-08-26 18:56:28,612 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2302 transitions. [2023-08-26 18:56:28,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2302 transitions. [2023-08-26 18:56:28,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:28,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2302 transitions. [2023-08-26 18:56:28,618 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 191.83333333333334) internal successors, (2302), 12 states have internal predecessors, (2302), 0 states have call successors, (0), 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 18:56:28,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 440.0) internal successors, (5720), 13 states have internal predecessors, (5720), 0 states have call successors, (0), 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 18:56:28,628 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 440.0) internal successors, (5720), 13 states have internal predecessors, (5720), 0 states have call successors, (0), 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 18:56:28,628 INFO L175 Difference]: Start difference. First operand has 75 places, 71 transitions, 176 flow. Second operand 12 states and 2302 transitions. [2023-08-26 18:56:28,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 77 transitions, 340 flow [2023-08-26 18:56:28,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 77 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:56:28,631 INFO L231 Difference]: Finished difference. Result has 90 places, 77 transitions, 256 flow [2023-08-26 18:56:28,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=256, PETRI_PLACES=90, PETRI_TRANSITIONS=77} [2023-08-26 18:56:28,632 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 18 predicate places. [2023-08-26 18:56:28,632 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 77 transitions, 256 flow [2023-08-26 18:56:28,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 187.15384615384616) internal successors, (2433), 13 states have internal predecessors, (2433), 0 states have call successors, (0), 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 18:56:28,633 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:28,633 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2023-08-26 18:56:28,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-26 18:56:28,838 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,SelfDestructingSolverStorable3 [2023-08-26 18:56:28,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:28,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash -463287217, now seen corresponding path program 2 times [2023-08-26 18:56:28,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:28,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205990805] [2023-08-26 18:56:28,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:28,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:28,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:28,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205990805] [2023-08-26 18:56:28,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205990805] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:56:28,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:56:28,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:56:28,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651359614] [2023-08-26 18:56:28,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:56:28,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:56:28,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:28,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:56:28,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:56:28,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 440 [2023-08-26 18:56:28,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 77 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 18:56:28,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:28,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 440 [2023-08-26 18:56:28,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:29,177 INFO L124 PetriNetUnfolderBase]: 672/1398 cut-off events. [2023-08-26 18:56:29,177 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2023-08-26 18:56:29,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2732 conditions, 1398 events. 672/1398 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8418 event pairs, 400 based on Foata normal form. 0/943 useless extension candidates. Maximal degree in co-relation 2656. Up to 1237 conditions per place. [2023-08-26 18:56:29,186 INFO L140 encePairwiseOnDemand]: 436/440 looper letters, 88 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2023-08-26 18:56:29,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 101 transitions, 484 flow [2023-08-26 18:56:29,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:56:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:56:29,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 544 transitions. [2023-08-26 18:56:29,188 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4121212121212121 [2023-08-26 18:56:29,188 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 544 transitions. [2023-08-26 18:56:29,188 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 544 transitions. [2023-08-26 18:56:29,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:29,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 544 transitions. [2023-08-26 18:56:29,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 0 states have call successors, (0), 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 18:56:29,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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 18:56:29,192 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 440.0) internal successors, (1760), 4 states have internal predecessors, (1760), 0 states have call successors, (0), 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 18:56:29,192 INFO L175 Difference]: Start difference. First operand has 90 places, 77 transitions, 256 flow. Second operand 3 states and 544 transitions. [2023-08-26 18:56:29,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 101 transitions, 484 flow [2023-08-26 18:56:29,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 101 transitions, 436 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-26 18:56:29,196 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 218 flow [2023-08-26 18:56:29,196 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-08-26 18:56:29,197 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2023-08-26 18:56:29,197 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 218 flow [2023-08-26 18:56:29,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 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 18:56:29,197 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:29,198 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1] [2023-08-26 18:56:29,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:56:29,198 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:29,198 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2058907372, now seen corresponding path program 1 times [2023-08-26 18:56:29,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:29,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735430307] [2023-08-26 18:56:29,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:29,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:29,317 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:29,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:29,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735430307] [2023-08-26 18:56:29,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735430307] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:56:29,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711308463] [2023-08-26 18:56:29,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:29,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:29,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:56:29,319 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 18:56:29,321 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 18:56:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:29,401 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-26 18:56:29,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:56:29,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-26 18:56:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:29,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:56:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:29,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711308463] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:56:29,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:56:29,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2023-08-26 18:56:29,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546493488] [2023-08-26 18:56:29,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:56:29,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 18:56:29,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:29,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 18:56:29,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 18:56:29,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 440 [2023-08-26 18:56:29,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 218 flow. Second operand has 8 states, 8 states have (on average 156.125) internal successors, (1249), 8 states have internal predecessors, (1249), 0 states have call successors, (0), 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 18:56:29,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:29,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 440 [2023-08-26 18:56:29,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:29,620 INFO L124 PetriNetUnfolderBase]: 51/148 cut-off events. [2023-08-26 18:56:29,620 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-08-26 18:56:29,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 148 events. 51/148 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 470 event pairs, 16 based on Foata normal form. 23/147 useless extension candidates. Maximal degree in co-relation 320. Up to 92 conditions per place. [2023-08-26 18:56:29,621 INFO L140 encePairwiseOnDemand]: 436/440 looper letters, 59 selfloop transitions, 2 changer transitions 2/69 dead transitions. [2023-08-26 18:56:29,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 69 transitions, 321 flow [2023-08-26 18:56:29,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:56:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:56:29,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2023-08-26 18:56:29,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38125 [2023-08-26 18:56:29,623 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 671 transitions. [2023-08-26 18:56:29,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 671 transitions. [2023-08-26 18:56:29,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:29,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 671 transitions. [2023-08-26 18:56:29,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 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 18:56:29,627 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 440.0) internal successors, (2200), 5 states have internal predecessors, (2200), 0 states have call successors, (0), 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 18:56:29,628 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 440.0) internal successors, (2200), 5 states have internal predecessors, (2200), 0 states have call successors, (0), 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 18:56:29,628 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 218 flow. Second operand 4 states and 671 transitions. [2023-08-26 18:56:29,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 69 transitions, 321 flow [2023-08-26 18:56:29,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 315 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 18:56:29,630 INFO L231 Difference]: Finished difference. Result has 59 places, 44 transitions, 143 flow [2023-08-26 18:56:29,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=143, PETRI_PLACES=59, PETRI_TRANSITIONS=44} [2023-08-26 18:56:29,631 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-08-26 18:56:29,631 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 44 transitions, 143 flow [2023-08-26 18:56:29,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 156.125) internal successors, (1249), 8 states have internal predecessors, (1249), 0 states have call successors, (0), 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 18:56:29,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:29,632 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:56:29,640 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 18:56:29,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:29,840 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:29,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:29,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1369092849, now seen corresponding path program 1 times [2023-08-26 18:56:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499601059] [2023-08-26 18:56:29,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:30,230 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:30,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:30,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499601059] [2023-08-26 18:56:30,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499601059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:56:30,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:56:30,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:56:30,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532139188] [2023-08-26 18:56:30,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:56:30,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:56:30,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:30,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:56:30,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:56:30,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 440 [2023-08-26 18:56:30,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 44 transitions, 143 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 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 18:56:30,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:30,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 440 [2023-08-26 18:56:30,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:30,440 INFO L124 PetriNetUnfolderBase]: 102/264 cut-off events. [2023-08-26 18:56:30,440 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-08-26 18:56:30,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 264 events. 102/264 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 890 event pairs, 48 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 552. Up to 128 conditions per place. [2023-08-26 18:56:30,442 INFO L140 encePairwiseOnDemand]: 432/440 looper letters, 63 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2023-08-26 18:56:30,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 343 flow [2023-08-26 18:56:30,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:56:30,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:56:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-26 18:56:30,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2837662337662338 [2023-08-26 18:56:30,446 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-26 18:56:30,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-26 18:56:30,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:30,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-26 18:56:30,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 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 18:56:30,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 440.0) internal successors, (3520), 8 states have internal predecessors, (3520), 0 states have call successors, (0), 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 18:56:30,453 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 440.0) internal successors, (3520), 8 states have internal predecessors, (3520), 0 states have call successors, (0), 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 18:56:30,453 INFO L175 Difference]: Start difference. First operand has 59 places, 44 transitions, 143 flow. Second operand 7 states and 874 transitions. [2023-08-26 18:56:30,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 343 flow [2023-08-26 18:56:30,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 337 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:56:30,455 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 170 flow [2023-08-26 18:56:30,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=170, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2023-08-26 18:56:30,456 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2023-08-26 18:56:30,456 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 170 flow [2023-08-26 18:56:30,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 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 18:56:30,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:30,457 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:56:30,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:56:30,458 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:30,458 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:30,458 INFO L85 PathProgramCache]: Analyzing trace with hash -507799368, now seen corresponding path program 1 times [2023-08-26 18:56:30,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:30,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166533367] [2023-08-26 18:56:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:30,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:30,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:30,742 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:30,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166533367] [2023-08-26 18:56:30,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166533367] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:56:30,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:56:30,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:56:30,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074758723] [2023-08-26 18:56:30,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:56:30,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:56:30,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:30,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:56:30,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:56:30,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 440 [2023-08-26 18:56:30,745 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 170 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 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 18:56:30,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:30,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 440 [2023-08-26 18:56:30,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:30,896 INFO L124 PetriNetUnfolderBase]: 137/409 cut-off events. [2023-08-26 18:56:30,896 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2023-08-26 18:56:30,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 409 events. 137/409 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1845 event pairs, 2 based on Foata normal form. 0/348 useless extension candidates. Maximal degree in co-relation 918. Up to 171 conditions per place. [2023-08-26 18:56:30,899 INFO L140 encePairwiseOnDemand]: 433/440 looper letters, 76 selfloop transitions, 12 changer transitions 0/91 dead transitions. [2023-08-26 18:56:30,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 91 transitions, 467 flow [2023-08-26 18:56:30,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:56:30,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:56:30,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 822 transitions. [2023-08-26 18:56:30,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31136363636363634 [2023-08-26 18:56:30,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 822 transitions. [2023-08-26 18:56:30,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 822 transitions. [2023-08-26 18:56:30,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:30,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 822 transitions. [2023-08-26 18:56:30,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 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 18:56:30,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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 18:56:30,909 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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 18:56:30,909 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 170 flow. Second operand 6 states and 822 transitions. [2023-08-26 18:56:30,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 91 transitions, 467 flow [2023-08-26 18:56:30,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 91 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:56:30,911 INFO L231 Difference]: Finished difference. Result has 69 places, 56 transitions, 247 flow [2023-08-26 18:56:30,911 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=69, PETRI_TRANSITIONS=56} [2023-08-26 18:56:30,914 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-08-26 18:56:30,914 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 56 transitions, 247 flow [2023-08-26 18:56:30,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 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 18:56:30,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:30,915 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:56:30,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:56:30,915 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:30,915 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash -507799538, now seen corresponding path program 1 times [2023-08-26 18:56:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:30,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320195181] [2023-08-26 18:56:30,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:31,149 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:31,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:31,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320195181] [2023-08-26 18:56:31,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320195181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:56:31,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:56:31,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:56:31,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172708066] [2023-08-26 18:56:31,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:56:31,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:56:31,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:31,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:56:31,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:56:31,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 440 [2023-08-26 18:56:31,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 56 transitions, 247 flow. Second operand has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 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 18:56:31,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:31,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 440 [2023-08-26 18:56:31,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:31,227 INFO L124 PetriNetUnfolderBase]: 111/323 cut-off events. [2023-08-26 18:56:31,227 INFO L125 PetriNetUnfolderBase]: For 254/254 co-relation queries the response was YES. [2023-08-26 18:56:31,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 323 events. 111/323 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1252 event pairs, 18 based on Foata normal form. 22/331 useless extension candidates. Maximal degree in co-relation 905. Up to 272 conditions per place. [2023-08-26 18:56:31,229 INFO L140 encePairwiseOnDemand]: 433/440 looper letters, 48 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-08-26 18:56:31,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 53 transitions, 346 flow [2023-08-26 18:56:31,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:56:31,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:56:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-26 18:56:31,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3079545454545455 [2023-08-26 18:56:31,231 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-26 18:56:31,231 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-26 18:56:31,232 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:31,232 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-26 18:56:31,233 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 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 18:56:31,235 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 440.0) internal successors, (2200), 5 states have internal predecessors, (2200), 0 states have call successors, (0), 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 18:56:31,236 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 440.0) internal successors, (2200), 5 states have internal predecessors, (2200), 0 states have call successors, (0), 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 18:56:31,236 INFO L175 Difference]: Start difference. First operand has 69 places, 56 transitions, 247 flow. Second operand 4 states and 542 transitions. [2023-08-26 18:56:31,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 53 transitions, 346 flow [2023-08-26 18:56:31,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 53 transitions, 342 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-26 18:56:31,238 INFO L231 Difference]: Finished difference. Result has 66 places, 51 transitions, 237 flow [2023-08-26 18:56:31,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=237, PETRI_PLACES=66, PETRI_TRANSITIONS=51} [2023-08-26 18:56:31,240 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-08-26 18:56:31,240 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 51 transitions, 237 flow [2023-08-26 18:56:31,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.66666666666666) internal successors, (772), 6 states have internal predecessors, (772), 0 states have call successors, (0), 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 18:56:31,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:31,240 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:56:31,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:56:31,241 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:31,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:31,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1281562482, now seen corresponding path program 1 times [2023-08-26 18:56:31,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:31,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111444189] [2023-08-26 18:56:31,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:31,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:31,578 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:31,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111444189] [2023-08-26 18:56:31,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111444189] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:56:31,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837397803] [2023-08-26 18:56:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:31,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:31,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:56:31,581 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 18:56:31,600 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 18:56:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:31,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-26 18:56:31,691 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:56:31,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 18:56:31,773 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:56:31,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:56:31,792 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 18:56:31,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 18:56:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:31,855 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:56:37,908 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 18:56:39,926 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2023-08-26 18:56:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 18:56:40,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837397803] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:56:40,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:56:40,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2023-08-26 18:56:40,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052412959] [2023-08-26 18:56:40,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:56:40,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-26 18:56:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:40,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-26 18:56:40,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=98, Unknown=5, NotChecked=42, Total=182 [2023-08-26 18:56:40,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 440 [2023-08-26 18:56:40,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 51 transitions, 237 flow. Second operand has 14 states, 14 states have (on average 127.57142857142857) internal successors, (1786), 14 states have internal predecessors, (1786), 0 states have call successors, (0), 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 18:56:40,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:40,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 440 [2023-08-26 18:56:40,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:42,400 INFO L124 PetriNetUnfolderBase]: 111/321 cut-off events. [2023-08-26 18:56:42,400 INFO L125 PetriNetUnfolderBase]: For 252/252 co-relation queries the response was YES. [2023-08-26 18:56:42,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 321 events. 111/321 cut-off events. For 252/252 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1227 event pairs, 18 based on Foata normal form. 2/309 useless extension candidates. Maximal degree in co-relation 899. Up to 136 conditions per place. [2023-08-26 18:56:42,402 INFO L140 encePairwiseOnDemand]: 433/440 looper letters, 58 selfloop transitions, 8 changer transitions 0/69 dead transitions. [2023-08-26 18:56:42,402 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 433 flow [2023-08-26 18:56:42,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:56:42,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:56:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-08-26 18:56:42,405 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30265151515151517 [2023-08-26 18:56:42,406 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-08-26 18:56:42,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-08-26 18:56:42,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:42,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-08-26 18:56:42,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 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 18:56:42,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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 18:56:42,411 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 440.0) internal successors, (3080), 7 states have internal predecessors, (3080), 0 states have call successors, (0), 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 18:56:42,411 INFO L175 Difference]: Start difference. First operand has 66 places, 51 transitions, 237 flow. Second operand 6 states and 799 transitions. [2023-08-26 18:56:42,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 433 flow [2023-08-26 18:56:42,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:56:42,414 INFO L231 Difference]: Finished difference. Result has 70 places, 51 transitions, 255 flow [2023-08-26 18:56:42,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=70, PETRI_TRANSITIONS=51} [2023-08-26 18:56:42,415 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2023-08-26 18:56:42,415 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 51 transitions, 255 flow [2023-08-26 18:56:42,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 127.57142857142857) internal successors, (1786), 14 states have internal predecessors, (1786), 0 states have call successors, (0), 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 18:56:42,416 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:42,416 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:56:42,428 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 18:56:42,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:42,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:42,623 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:42,623 INFO L85 PathProgramCache]: Analyzing trace with hash -805398504, now seen corresponding path program 1 times [2023-08-26 18:56:42,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:42,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844238430] [2023-08-26 18:56:42,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:42,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:42,978 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:42,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844238430] [2023-08-26 18:56:42,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844238430] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:56:42,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621068655] [2023-08-26 18:56:42,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:42,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:42,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:56:42,980 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 18:56:42,982 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 18:56:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:43,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-26 18:56:43,089 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:56:43,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:56:43,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:56:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:43,301 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:56:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:43,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621068655] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:56:43,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:56:43,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 17 [2023-08-26 18:56:43,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524079957] [2023-08-26 18:56:43,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:56:43,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-26 18:56:43,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:56:43,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-26 18:56:43,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-08-26 18:56:43,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 440 [2023-08-26 18:56:43,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 51 transitions, 255 flow. Second operand has 19 states, 19 states have (on average 136.21052631578948) internal successors, (2588), 19 states have internal predecessors, (2588), 0 states have call successors, (0), 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 18:56:43,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:56:43,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 440 [2023-08-26 18:56:43,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:56:44,125 INFO L124 PetriNetUnfolderBase]: 262/763 cut-off events. [2023-08-26 18:56:44,125 INFO L125 PetriNetUnfolderBase]: For 651/653 co-relation queries the response was YES. [2023-08-26 18:56:44,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 763 events. 262/763 cut-off events. For 651/653 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3540 event pairs, 44 based on Foata normal form. 54/784 useless extension candidates. Maximal degree in co-relation 2157. Up to 136 conditions per place. [2023-08-26 18:56:44,130 INFO L140 encePairwiseOnDemand]: 429/440 looper letters, 126 selfloop transitions, 21 changer transitions 0/151 dead transitions. [2023-08-26 18:56:44,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 151 transitions, 980 flow [2023-08-26 18:56:44,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-26 18:56:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-26 18:56:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1717 transitions. [2023-08-26 18:56:44,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32518939393939394 [2023-08-26 18:56:44,136 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1717 transitions. [2023-08-26 18:56:44,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1717 transitions. [2023-08-26 18:56:44,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:56:44,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1717 transitions. [2023-08-26 18:56:44,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 143.08333333333334) internal successors, (1717), 12 states have internal predecessors, (1717), 0 states have call successors, (0), 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 18:56:44,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 440.0) internal successors, (5720), 13 states have internal predecessors, (5720), 0 states have call successors, (0), 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 18:56:44,159 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 440.0) internal successors, (5720), 13 states have internal predecessors, (5720), 0 states have call successors, (0), 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 18:56:44,160 INFO L175 Difference]: Start difference. First operand has 70 places, 51 transitions, 255 flow. Second operand 12 states and 1717 transitions. [2023-08-26 18:56:44,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 151 transitions, 980 flow [2023-08-26 18:56:44,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 151 transitions, 941 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 18:56:44,165 INFO L231 Difference]: Finished difference. Result has 80 places, 64 transitions, 406 flow [2023-08-26 18:56:44,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=406, PETRI_PLACES=80, PETRI_TRANSITIONS=64} [2023-08-26 18:56:44,166 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 8 predicate places. [2023-08-26 18:56:44,166 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 64 transitions, 406 flow [2023-08-26 18:56:44,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 136.21052631578948) internal successors, (2588), 19 states have internal predecessors, (2588), 0 states have call successors, (0), 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 18:56:44,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:56:44,167 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:56:44,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-26 18:56:44,372 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,SelfDestructingSolverStorable10 [2023-08-26 18:56:44,372 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:56:44,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:56:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1316395684, now seen corresponding path program 1 times [2023-08-26 18:56:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:56:44,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840782857] [2023-08-26 18:56:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:56:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:45,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:56:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840782857] [2023-08-26 18:56:45,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840782857] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:56:45,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575613137] [2023-08-26 18:56:45,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:56:45,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:56:45,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:56:45,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:56:45,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 18:56:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:56:45,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-26 18:56:45,526 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:56:45,530 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 18:56:45,609 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:56:45,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:56:45,632 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 18:56:45,723 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 18:56:45,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 18:56:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:56:50,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:57:03,973 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 18:57:05,996 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_443)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 18:57:22,190 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_443 Int) (v_ArrVal_439 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| 28)) (= 0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_439) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_91| v_ArrVal_443) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_90|)))) is different from false [2023-08-26 18:57:22,364 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2023-08-26 18:57:22,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575613137] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:57:22,364 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:57:22,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2023-08-26 18:57:22,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483219830] [2023-08-26 18:57:22,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:57:22,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-26 18:57:22,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:57:22,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-26 18:57:22,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=312, Unknown=20, NotChecked=120, Total=552 [2023-08-26 18:57:22,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 440 [2023-08-26 18:57:22,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 64 transitions, 406 flow. Second operand has 24 states, 24 states have (on average 128.41666666666666) internal successors, (3082), 24 states have internal predecessors, (3082), 0 states have call successors, (0), 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 18:57:22,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:57:22,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 440 [2023-08-26 18:57:22,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:57:23,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:57:26,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:57:28,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:57:34,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:57:37,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:57:39,591 INFO L124 PetriNetUnfolderBase]: 404/1169 cut-off events. [2023-08-26 18:57:39,591 INFO L125 PetriNetUnfolderBase]: For 1434/1444 co-relation queries the response was YES. [2023-08-26 18:57:39,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3637 conditions, 1169 events. 404/1169 cut-off events. For 1434/1444 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 6246 event pairs, 31 based on Foata normal form. 12/1133 useless extension candidates. Maximal degree in co-relation 3574. Up to 381 conditions per place. [2023-08-26 18:57:39,600 INFO L140 encePairwiseOnDemand]: 430/440 looper letters, 105 selfloop transitions, 33 changer transitions 0/142 dead transitions. [2023-08-26 18:57:39,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 142 transitions, 1125 flow [2023-08-26 18:57:39,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 18:57:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 18:57:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1465 transitions. [2023-08-26 18:57:39,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30268595041322316 [2023-08-26 18:57:39,605 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1465 transitions. [2023-08-26 18:57:39,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1465 transitions. [2023-08-26 18:57:39,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:57:39,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1465 transitions. [2023-08-26 18:57:39,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 133.1818181818182) internal successors, (1465), 11 states have internal predecessors, (1465), 0 states have call successors, (0), 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 18:57:39,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 440.0) internal successors, (5280), 12 states have internal predecessors, (5280), 0 states have call successors, (0), 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 18:57:39,614 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 440.0) internal successors, (5280), 12 states have internal predecessors, (5280), 0 states have call successors, (0), 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 18:57:39,614 INFO L175 Difference]: Start difference. First operand has 80 places, 64 transitions, 406 flow. Second operand 11 states and 1465 transitions. [2023-08-26 18:57:39,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 142 transitions, 1125 flow [2023-08-26 18:57:39,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 142 transitions, 1029 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-08-26 18:57:39,622 INFO L231 Difference]: Finished difference. Result has 90 places, 92 transitions, 716 flow [2023-08-26 18:57:39,622 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=716, PETRI_PLACES=90, PETRI_TRANSITIONS=92} [2023-08-26 18:57:39,623 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 18 predicate places. [2023-08-26 18:57:39,623 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 92 transitions, 716 flow [2023-08-26 18:57:39,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 128.41666666666666) internal successors, (3082), 24 states have internal predecessors, (3082), 0 states have call successors, (0), 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 18:57:39,624 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:57:39,624 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:57:39,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-26 18:57:39,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:57:39,830 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:57:39,830 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:57:39,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1977168116, now seen corresponding path program 1 times [2023-08-26 18:57:39,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:57:39,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169930838] [2023-08-26 18:57:39,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:57:39,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:57:39,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:57:41,205 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:57:41,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:57:41,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169930838] [2023-08-26 18:57:41,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169930838] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:57:41,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760521610] [2023-08-26 18:57:41,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:57:41,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:57:41,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:57:41,207 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:57:41,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 18:57:41,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:57:41,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-26 18:57:41,336 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:57:41,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 18:57:41,420 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:57:41,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:57:41,457 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 18:57:41,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 18:57:41,645 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 18:57:41,700 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 18:57:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:57:45,146 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:58:01,222 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 18:58:03,250 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (v_ArrVal_544 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_544) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 18:58:05,272 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (v_ArrVal_544 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_543)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_544) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 18:58:05,340 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (v_ArrVal_544 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_543)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_544) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| 28)))) is different from false [2023-08-26 18:58:05,367 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| Int) (v_ArrVal_543 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| Int) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| v_ArrVal_543))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_544) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_94| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_95| 28)))) is different from false [2023-08-26 18:58:05,533 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-08-26 18:58:05,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760521610] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:58:05,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:58:05,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-08-26 18:58:05,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660484627] [2023-08-26 18:58:05,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:58:05,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-26 18:58:05,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:05,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-26 18:58:05,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=382, Unknown=15, NotChecked=220, Total=702 [2023-08-26 18:58:05,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 440 [2023-08-26 18:58:05,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 92 transitions, 716 flow. Second operand has 27 states, 27 states have (on average 128.37037037037038) internal successors, (3466), 27 states have internal predecessors, (3466), 0 states have call successors, (0), 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 18:58:05,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:05,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 440 [2023-08-26 18:58:05,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:58:06,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:08,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:09,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:19,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:23,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:29,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:32,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:42,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 18:58:53,282 INFO L124 PetriNetUnfolderBase]: 469/1436 cut-off events. [2023-08-26 18:58:53,283 INFO L125 PetriNetUnfolderBase]: For 3601/3601 co-relation queries the response was YES. [2023-08-26 18:58:53,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5249 conditions, 1436 events. 469/1436 cut-off events. For 3601/3601 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8411 event pairs, 85 based on Foata normal form. 7/1386 useless extension candidates. Maximal degree in co-relation 5180. Up to 318 conditions per place. [2023-08-26 18:58:53,301 INFO L140 encePairwiseOnDemand]: 428/440 looper letters, 176 selfloop transitions, 56 changer transitions 0/236 dead transitions. [2023-08-26 18:58:53,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 236 transitions, 2152 flow [2023-08-26 18:58:53,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-26 18:58:53,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-26 18:58:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2784 transitions. [2023-08-26 18:58:53,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3012987012987013 [2023-08-26 18:58:53,312 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2784 transitions. [2023-08-26 18:58:53,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2784 transitions. [2023-08-26 18:58:53,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:58:53,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2784 transitions. [2023-08-26 18:58:53,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 132.57142857142858) internal successors, (2784), 21 states have internal predecessors, (2784), 0 states have call successors, (0), 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 18:58:53,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 440.0) internal successors, (9680), 22 states have internal predecessors, (9680), 0 states have call successors, (0), 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 18:58:53,334 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 440.0) internal successors, (9680), 22 states have internal predecessors, (9680), 0 states have call successors, (0), 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 18:58:53,334 INFO L175 Difference]: Start difference. First operand has 90 places, 92 transitions, 716 flow. Second operand 21 states and 2784 transitions. [2023-08-26 18:58:53,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 236 transitions, 2152 flow [2023-08-26 18:58:53,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 236 transitions, 2080 flow, removed 29 selfloop flow, removed 3 redundant places. [2023-08-26 18:58:53,349 INFO L231 Difference]: Finished difference. Result has 119 places, 124 transitions, 1183 flow [2023-08-26 18:58:53,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=673, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1183, PETRI_PLACES=119, PETRI_TRANSITIONS=124} [2023-08-26 18:58:53,350 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 47 predicate places. [2023-08-26 18:58:53,350 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 124 transitions, 1183 flow [2023-08-26 18:58:53,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 128.37037037037038) internal successors, (3466), 27 states have internal predecessors, (3466), 0 states have call successors, (0), 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 18:58:53,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:58:53,351 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-08-26 18:58:53,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 18:58:53,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:53,561 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:58:53,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:58:53,561 INFO L85 PathProgramCache]: Analyzing trace with hash -789991411, now seen corresponding path program 2 times [2023-08-26 18:58:53,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:58:53,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474676593] [2023-08-26 18:58:53,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:58:53,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:58:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:58:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:54,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:58:54,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474676593] [2023-08-26 18:58:54,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474676593] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:58:54,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292298482] [2023-08-26 18:58:54,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:58:54,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:58:54,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:58:54,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:58:54,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-26 18:58:54,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:58:54,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:58:54,234 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-26 18:58:54,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:58:54,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-26 18:58:54,348 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-26 18:58:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 40 proven. 8 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:54,727 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:58:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:58:59,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292298482] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 18:58:59,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 18:58:59,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 27 [2023-08-26 18:58:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402453792] [2023-08-26 18:58:59,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 18:58:59,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-26 18:58:59,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:58:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-26 18:58:59,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=644, Unknown=0, NotChecked=0, Total=812 [2023-08-26 18:58:59,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 440 [2023-08-26 18:58:59,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 124 transitions, 1183 flow. Second operand has 29 states, 29 states have (on average 137.0) internal successors, (3973), 29 states have internal predecessors, (3973), 0 states have call successors, (0), 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 18:58:59,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:58:59,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 440 [2023-08-26 18:58:59,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:59:00,579 INFO L124 PetriNetUnfolderBase]: 580/1777 cut-off events. [2023-08-26 18:59:00,580 INFO L125 PetriNetUnfolderBase]: For 7931/7933 co-relation queries the response was YES. [2023-08-26 18:59:00,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 1777 events. 580/1777 cut-off events. For 7931/7933 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10706 event pairs, 105 based on Foata normal form. 60/1764 useless extension candidates. Maximal degree in co-relation 7435. Up to 393 conditions per place. [2023-08-26 18:59:00,595 INFO L140 encePairwiseOnDemand]: 433/440 looper letters, 249 selfloop transitions, 42 changer transitions 0/295 dead transitions. [2023-08-26 18:59:00,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 295 transitions, 3093 flow [2023-08-26 18:59:00,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 18:59:00,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 18:59:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1860 transitions. [2023-08-26 18:59:00,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.32517482517482516 [2023-08-26 18:59:00,601 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1860 transitions. [2023-08-26 18:59:00,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1860 transitions. [2023-08-26 18:59:00,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:59:00,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1860 transitions. [2023-08-26 18:59:00,605 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 143.07692307692307) internal successors, (1860), 13 states have internal predecessors, (1860), 0 states have call successors, (0), 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 18:59:00,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 440.0) internal successors, (6160), 14 states have internal predecessors, (6160), 0 states have call successors, (0), 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 18:59:00,612 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 440.0) internal successors, (6160), 14 states have internal predecessors, (6160), 0 states have call successors, (0), 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 18:59:00,612 INFO L175 Difference]: Start difference. First operand has 119 places, 124 transitions, 1183 flow. Second operand 13 states and 1860 transitions. [2023-08-26 18:59:00,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 295 transitions, 3093 flow [2023-08-26 18:59:00,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 295 transitions, 2978 flow, removed 25 selfloop flow, removed 8 redundant places. [2023-08-26 18:59:00,635 INFO L231 Difference]: Finished difference. Result has 122 places, 140 transitions, 1409 flow [2023-08-26 18:59:00,636 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=1074, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1409, PETRI_PLACES=122, PETRI_TRANSITIONS=140} [2023-08-26 18:59:00,636 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 50 predicate places. [2023-08-26 18:59:00,636 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 140 transitions, 1409 flow [2023-08-26 18:59:00,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 137.0) internal successors, (3973), 29 states have internal predecessors, (3973), 0 states have call successors, (0), 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 18:59:00,637 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:59:00,637 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:59:00,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-26 18:59:00,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-26 18:59:00,847 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 18:59:00,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:59:00,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1076160456, now seen corresponding path program 2 times [2023-08-26 18:59:00,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:59:00,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335505969] [2023-08-26 18:59:00,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:59:00,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:59:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:59:03,329 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:59:03,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:59:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335505969] [2023-08-26 18:59:03,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335505969] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 18:59:03,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491618011] [2023-08-26 18:59:03,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 18:59:03,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 18:59:03,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:59:03,337 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 18:59:03,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-26 18:59:03,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 18:59:03,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 18:59:03,511 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-26 18:59:03,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 18:59:03,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 18:59:03,601 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 18:59:03,601 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 18:59:03,623 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 18:59:03,709 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 18:59:03,763 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 18:59:09,908 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 18:59:12,561 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 18:59:38,360 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 18:59:38,360 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 18:59:58,374 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:00:00,391 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_798 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_798)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:00:02,442 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_798 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| v_ArrVal_798) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 19:00:04,459 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_77| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_77| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_798 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| v_ArrVal_798) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| (+ .cse0 28 |c_~#cache~0.offset|))))))) is different from false [2023-08-26 19:00:06,501 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (v_ArrVal_794 Int) (|v_t_funThread1of1ForFork0_~i~0#1_77| Int) (v_ArrVal_798 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_77| 28))) (or (= (select (store (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_794)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| v_ArrVal_798) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_77| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 19:00:24,816 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| Int) (v_ArrVal_794 Int) (v_ArrVal_791 (Array Int Int)) (v_ArrVal_798 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| Int)) (or (= (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_791) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107| v_ArrVal_794) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106| v_ArrVal_798) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_106|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_105| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_107|)))) is different from false [2023-08-26 19:00:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 16 not checked. [2023-08-26 19:00:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491618011] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:00:25,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:00:25,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 10] total 32 [2023-08-26 19:00:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345872167] [2023-08-26 19:00:25,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:00:25,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-26 19:00:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:00:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-26 19:00:25,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=586, Unknown=43, NotChecked=342, Total=1122 [2023-08-26 19:00:25,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 440 [2023-08-26 19:00:25,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 140 transitions, 1409 flow. Second operand has 34 states, 34 states have (on average 128.6764705882353) internal successors, (4375), 34 states have internal predecessors, (4375), 0 states have call successors, (0), 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 19:00:25,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:00:25,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 440 [2023-08-26 19:00:25,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:00:27,046 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 [0] [2023-08-26 19:00:29,061 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 [0] [2023-08-26 19:00:30,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:00:37,373 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 [0] [2023-08-26 19:00:39,388 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 [0] [2023-08-26 19:00:40,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:00:42,519 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 [0] [2023-08-26 19:00:44,533 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 [0] [2023-08-26 19:00:45,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:00:53,042 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 [0] [2023-08-26 19:00:55,057 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 [0] [2023-08-26 19:00:56,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:01:03,333 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 [0] [2023-08-26 19:01:05,349 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 [0] [2023-08-26 19:01:06,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:01:08,434 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 [0] [2023-08-26 19:01:10,444 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 [0] [2023-08-26 19:01:11,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:01:19,842 WARN L234 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 42 DAG size of output: 40 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:01:26,366 WARN L234 SmtUtils]: Spent 6.50s on a formula simplification. DAG size of input: 73 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:01:40,255 WARN L234 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 50 DAG size of output: 39 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:01:52,874 INFO L124 PetriNetUnfolderBase]: 771/2344 cut-off events. [2023-08-26 19:01:52,875 INFO L125 PetriNetUnfolderBase]: For 11667/11693 co-relation queries the response was YES. [2023-08-26 19:01:52,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10198 conditions, 2344 events. 771/2344 cut-off events. For 11667/11693 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 14567 event pairs, 64 based on Foata normal form. 35/2284 useless extension candidates. Maximal degree in co-relation 10119. Up to 617 conditions per place. [2023-08-26 19:01:52,891 INFO L140 encePairwiseOnDemand]: 431/440 looper letters, 173 selfloop transitions, 79 changer transitions 0/256 dead transitions. [2023-08-26 19:01:52,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 256 transitions, 2991 flow [2023-08-26 19:01:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-26 19:01:52,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-26 19:01:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2127 transitions. [2023-08-26 19:01:52,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3021306818181818 [2023-08-26 19:01:52,895 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2127 transitions. [2023-08-26 19:01:52,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2127 transitions. [2023-08-26 19:01:52,895 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:01:52,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2127 transitions. [2023-08-26 19:01:52,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 132.9375) internal successors, (2127), 16 states have internal predecessors, (2127), 0 states have call successors, (0), 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 19:01:52,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 440.0) internal successors, (7480), 17 states have internal predecessors, (7480), 0 states have call successors, (0), 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 19:01:52,905 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 440.0) internal successors, (7480), 17 states have internal predecessors, (7480), 0 states have call successors, (0), 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 19:01:52,905 INFO L175 Difference]: Start difference. First operand has 122 places, 140 transitions, 1409 flow. Second operand 16 states and 2127 transitions. [2023-08-26 19:01:52,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 256 transitions, 2991 flow [2023-08-26 19:01:52,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 256 transitions, 2920 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-26 19:01:52,933 INFO L231 Difference]: Finished difference. Result has 137 places, 174 transitions, 2092 flow [2023-08-26 19:01:52,934 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2092, PETRI_PLACES=137, PETRI_TRANSITIONS=174} [2023-08-26 19:01:52,934 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 65 predicate places. [2023-08-26 19:01:52,934 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 174 transitions, 2092 flow [2023-08-26 19:01:52,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 128.6764705882353) internal successors, (4375), 34 states have internal predecessors, (4375), 0 states have call successors, (0), 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 19:01:52,935 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:01:52,935 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:01:52,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-26 19:01:53,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-26 19:01:53,142 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:01:53,142 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:01:53,142 INFO L85 PathProgramCache]: Analyzing trace with hash -210857468, now seen corresponding path program 2 times [2023-08-26 19:01:53,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:01:53,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544547706] [2023-08-26 19:01:53,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:01:53,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:01:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:01:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:01:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:01:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544547706] [2023-08-26 19:01:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544547706] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:01:56,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1488559439] [2023-08-26 19:01:56,518 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 19:01:56,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:01:56,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:01:56,520 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:01:56,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-26 19:01:56,658 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 19:01:56,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:01:56,660 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-26 19:01:56,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:01:56,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:01:56,747 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:01:56,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:01:56,777 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:01:56,867 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 19:01:56,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 19:01:57,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-26 19:02:02,196 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 19:02:05,115 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 19:02:28,592 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:02:28,592 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:02:50,703 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:02:52,723 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_935 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_935)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:02:54,778 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_935 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| v_ArrVal_935) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 19:02:56,806 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_83| Int)) (or (forall ((v_ArrVal_935 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (or (= (select (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| v_ArrVal_935) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 28 |c_~#cache~0.offset| .cse0))))) (< |v_t_funThread1of1ForFork0_~i~0#1_83| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2023-08-26 19:02:58,822 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_935 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (or (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112|) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_932) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| v_ArrVal_935) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_83| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-08-26 19:03:00,862 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int)) (|v_t_funThread1of1ForFork0_~i~0#1_83| Int) (v_ArrVal_935 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| Int) (v_ArrVal_931 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_83| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_931)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_932) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| v_ArrVal_935) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 28 |c_~#cache~0.offset| .cse0)) (< |v_t_funThread1of1ForFork0_~i~0#1_83| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2023-08-26 19:03:01,011 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_935 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| Int) (v_ArrVal_931 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113|)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| v_ArrVal_931)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_932) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| v_ArrVal_935) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0))) is different from false [2023-08-26 19:03:01,054 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_932 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_935 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| Int) (v_ArrVal_931 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113|)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_927))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_113| v_ArrVal_931))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_932) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_112| v_ArrVal_935) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_111|) 0))) is different from false [2023-08-26 19:03:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 18 not checked. [2023-08-26 19:03:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1488559439] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:03:01,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:03:01,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 11] total 35 [2023-08-26 19:03:01,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170940958] [2023-08-26 19:03:01,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:03:01,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-26 19:03:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:03:01,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-26 19:03:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=689, Unknown=36, NotChecked=488, Total=1332 [2023-08-26 19:03:01,372 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 440 [2023-08-26 19:03:01,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 174 transitions, 2092 flow. Second operand has 37 states, 37 states have (on average 128.6216216216216) internal successors, (4759), 37 states have internal predecessors, (4759), 0 states have call successors, (0), 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 19:03:01,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:03:01,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 440 [2023-08-26 19:03:01,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:03:02,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:04,658 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 [0] [2023-08-26 19:03:06,676 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 [0] [2023-08-26 19:03:12,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:14,915 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 [0] [2023-08-26 19:03:16,939 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 [0] [2023-08-26 19:03:18,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:20,138 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 [0] [2023-08-26 19:03:22,156 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 [0] [2023-08-26 19:03:28,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:30,625 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 [0] [2023-08-26 19:03:32,647 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 [0] [2023-08-26 19:03:39,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:41,115 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 [0] [2023-08-26 19:03:43,134 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 [0] [2023-08-26 19:03:44,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:46,252 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 [0] [2023-08-26 19:03:48,275 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 [0] [2023-08-26 19:03:55,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:03:57,102 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 [0] [2023-08-26 19:03:59,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 [0] [2023-08-26 19:04:12,664 WARN L234 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 119 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:04:18,837 WARN L234 SmtUtils]: Spent 6.13s on a formula simplification. DAG size of input: 118 DAG size of output: 41 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:04:25,536 WARN L234 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 87 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:04:32,616 WARN L234 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 102 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:04:39,454 WARN L234 SmtUtils]: Spent 6.77s on a formula simplification. DAG size of input: 99 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:04:48,445 WARN L234 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 100 DAG size of output: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:04:58,227 WARN L234 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 110 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:05:13,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 19:05:15,209 INFO L124 PetriNetUnfolderBase]: 790/2511 cut-off events. [2023-08-26 19:05:15,210 INFO L125 PetriNetUnfolderBase]: For 17822/17830 co-relation queries the response was YES. [2023-08-26 19:05:15,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11959 conditions, 2511 events. 790/2511 cut-off events. For 17822/17830 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 16303 event pairs, 112 based on Foata normal form. 13/2427 useless extension candidates. Maximal degree in co-relation 11872. Up to 527 conditions per place. [2023-08-26 19:05:15,229 INFO L140 encePairwiseOnDemand]: 429/440 looper letters, 218 selfloop transitions, 121 changer transitions 0/343 dead transitions. [2023-08-26 19:05:15,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 343 transitions, 4555 flow [2023-08-26 19:05:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-26 19:05:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-26 19:05:15,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3181 transitions. [2023-08-26 19:05:15,235 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3012310606060606 [2023-08-26 19:05:15,235 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 3181 transitions. [2023-08-26 19:05:15,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 3181 transitions. [2023-08-26 19:05:15,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 19:05:15,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3181 transitions. [2023-08-26 19:05:15,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 132.54166666666666) internal successors, (3181), 24 states have internal predecessors, (3181), 0 states have call successors, (0), 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 19:05:15,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 440.0) internal successors, (11000), 25 states have internal predecessors, (11000), 0 states have call successors, (0), 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 19:05:15,252 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 440.0) internal successors, (11000), 25 states have internal predecessors, (11000), 0 states have call successors, (0), 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 19:05:15,252 INFO L175 Difference]: Start difference. First operand has 137 places, 174 transitions, 2092 flow. Second operand 24 states and 3181 transitions. [2023-08-26 19:05:15,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 343 transitions, 4555 flow [2023-08-26 19:05:15,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 343 transitions, 4277 flow, removed 84 selfloop flow, removed 8 redundant places. [2023-08-26 19:05:15,302 INFO L231 Difference]: Finished difference. Result has 162 places, 211 transitions, 2841 flow [2023-08-26 19:05:15,302 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=1862, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2841, PETRI_PLACES=162, PETRI_TRANSITIONS=211} [2023-08-26 19:05:15,303 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 90 predicate places. [2023-08-26 19:05:15,303 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 211 transitions, 2841 flow [2023-08-26 19:05:15,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 128.6216216216216) internal successors, (4759), 37 states have internal predecessors, (4759), 0 states have call successors, (0), 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 19:05:15,305 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 19:05:15,305 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 19:05:15,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-26 19:05:15,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-26 19:05:15,510 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr10ASSERT_VIOLATIONASSERT === [t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2023-08-26 19:05:15,511 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 19:05:15,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1107392318, now seen corresponding path program 3 times [2023-08-26 19:05:15,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 19:05:15,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217273969] [2023-08-26 19:05:15,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 19:05:15,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 19:05:15,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 19:05:18,818 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:05:18,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 19:05:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217273969] [2023-08-26 19:05:18,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217273969] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 19:05:18,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743160138] [2023-08-26 19:05:18,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 19:05:18,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 19:05:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 19:05:18,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 19:05:18,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-26 19:05:18,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-26 19:05:18,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 19:05:18,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-26 19:05:18,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 19:05:18,989 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2023-08-26 19:05:19,064 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-26 19:05:19,064 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-26 19:05:19,103 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2023-08-26 19:05:19,200 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-08-26 19:05:19,274 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 19:05:23,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-08-26 19:05:26,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-26 19:05:29,047 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2023-08-26 19:05:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-08-26 19:05:51,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 19:06:13,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:06:15,135 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (v_ArrVal_1072 Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1072)) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:06:15,147 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (v_ArrVal_1072 Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1071))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1072))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2023-08-26 19:06:15,177 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (v_ArrVal_1072 Int) (v_ArrVal_1069 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1069)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1071))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1072))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0))) is different from false [2023-08-26 19:06:15,217 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1072 Int) (v_ArrVal_1069 Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1069)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1071) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1072) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ .cse0 28 |c_~#cache~0.offset|)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)))) is different from false [2023-08-26 19:06:15,235 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_89| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_1071 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1072 Int) (v_ArrVal_1069 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1069)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1071) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1072) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ .cse0 28 |c_~#cache~0.offset|))))))) is different from false [2023-08-26 19:06:15,283 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1072 Int) (v_ArrVal_1067 Int) (v_ArrVal_1069 Int) (|v_t_funThread1of1ForFork0_~i~0#1_89| Int)) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_89| 28))) (or (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1067)))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1069))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1071) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1072) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|) (< |v_t_funThread1of1ForFork0_~i~0#1_89| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ .cse1 28 |c_~#cache~0.offset|))))) is different from false [2023-08-26 19:06:15,440 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1072 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| Int) (v_ArrVal_1067 Int) (v_ArrVal_1069 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)) (= (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| v_ArrVal_1067) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1069)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1071) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1072) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0))) is different from false [2023-08-26 19:06:15,481 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1071 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| Int) (v_ArrVal_1072 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| Int) (v_ArrVal_1067 Int) (v_ArrVal_1069 Int) (v_ArrVal_1064 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117| (+ 28 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118|)) (= (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1064))) (store .cse0 |c_~#cache~0.base| (store (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_119| v_ArrVal_1067) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1069))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1071) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_118| v_ArrVal_1072) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_117|) 0))) is different from false [2023-08-26 19:06:15,730 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 18 not checked. [2023-08-26 19:06:15,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743160138] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 19:06:15,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 19:06:15,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-08-26 19:06:15,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503007433] [2023-08-26 19:06:15,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 19:06:15,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-26 19:06:15,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 19:06:15,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-26 19:06:15,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=692, Unknown=37, NotChecked=558, Total=1406 [2023-08-26 19:06:15,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 440 [2023-08-26 19:06:15,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 211 transitions, 2841 flow. Second operand has 38 states, 38 states have (on average 128.55263157894737) internal successors, (4885), 38 states have internal predecessors, (4885), 0 states have call successors, (0), 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 19:06:15,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 19:06:15,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 440 [2023-08-26 19:06:15,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 19:06:17,746 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 [0] [2023-08-26 19:06:19,763 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 [0] [2023-08-26 19:06:25,827 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 [0] [2023-08-26 19:06:27,846 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 [0] [2023-08-26 19:06:29,927 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 [0] [2023-08-26 19:06:36,587 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 [0] [2023-08-26 19:06:42,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:06:44,125 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 [0] [2023-08-26 19:06:46,146 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 [0] [2023-08-26 19:06:55,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:06:57,580 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 [0] [2023-08-26 19:06:59,597 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 [0] [2023-08-26 19:07:03,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:07:05,089 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 [0] [2023-08-26 19:07:39,795 WARN L234 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 122 DAG size of output: 25 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:07:49,115 WARN L234 SmtUtils]: Spent 7.77s on a formula simplification. DAG size of input: 102 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:07:50,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:07:52,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:07:53,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:08:04,215 WARN L234 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 104 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:08:30,720 WARN L234 SmtUtils]: Spent 7.47s on a formula simplification. DAG size of input: 80 DAG size of output: 45 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:08:58,174 WARN L234 SmtUtils]: Spent 24.17s on a formula simplification. DAG size of input: 100 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 19:08:59,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:09:01,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-26 19:10:31,857 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 [] Received shutdown request... [2023-08-26 19:10:35,481 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 19:10:35,481 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 19:10:36,208 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 [1] [2023-08-26 19:10:36,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-26 19:10:36,682 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-26 19:10:36,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-26 19:10:36,704 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (36 of 37 remaining) [2023-08-26 19:10:36,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 19:10:36,705 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 19:10:36,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 37 remaining) [2023-08-26 19:10:36,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 37 remaining) [2023-08-26 19:10:36,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 37 remaining) [2023-08-26 19:10:36,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 37 remaining) [2023-08-26 19:10:36,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 37 remaining) [2023-08-26 19:10:36,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr10ASSERT_VIOLATIONASSERT (23 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 37 remaining) [2023-08-26 19:10:36,707 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 37 remaining) [2023-08-26 19:10:36,708 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr12ASSERT_VIOLATIONASSERT (6 of 37 remaining) [2023-08-26 19:10:36,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 37 remaining) [2023-08-26 19:10:36,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 37 remaining) [2023-08-26 19:10:36,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 37 remaining) [2023-08-26 19:10:36,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 37 remaining) [2023-08-26 19:10:36,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 37 remaining) [2023-08-26 19:10:36,709 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 37 remaining) [2023-08-26 19:10:36,709 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-26 19:10:36,711 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT,TIMEOUT (1/2) [2023-08-26 19:10:36,714 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 19:10:36,714 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 19:10:36,716 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 07:10:36 BasicIcfg [2023-08-26 19:10:36,716 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 19:10:36,717 INFO L158 Benchmark]: Toolchain (without parser) took 855853.34ms. Allocated memory was 398.5MB in the beginning and 788.5MB in the end (delta: 390.1MB). Free memory was 354.2MB in the beginning and 382.0MB in the end (delta: -27.7MB). Peak memory consumption was 364.4MB. Max. memory is 16.0GB. [2023-08-26 19:10:36,718 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 398.5MB. Free memory was 376.2MB in the beginning and 376.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 19:10:36,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 614.94ms. Allocated memory is still 398.5MB. Free memory was 354.2MB in the beginning and 324.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-26 19:10:36,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.93ms. Allocated memory is still 398.5MB. Free memory was 324.9MB in the beginning and 321.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:10:36,719 INFO L158 Benchmark]: Boogie Preprocessor took 62.79ms. Allocated memory is still 398.5MB. Free memory was 321.7MB in the beginning and 319.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 19:10:36,719 INFO L158 Benchmark]: RCFGBuilder took 578.61ms. Allocated memory is still 398.5MB. Free memory was 319.6MB in the beginning and 296.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 19:10:36,719 INFO L158 Benchmark]: TraceAbstraction took 854513.25ms. Allocated memory was 398.5MB in the beginning and 788.5MB in the end (delta: 390.1MB). Free memory was 295.5MB in the beginning and 382.0MB in the end (delta: -86.5MB). Peak memory consumption was 305.7MB. Max. memory is 16.0GB. [2023-08-26 19:10:36,720 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 398.5MB. Free memory was 376.2MB in the beginning and 376.0MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 614.94ms. Allocated memory is still 398.5MB. Free memory was 354.2MB in the beginning and 324.9MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.93ms. Allocated memory is still 398.5MB. Free memory was 324.9MB in the beginning and 321.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 62.79ms. Allocated memory is still 398.5MB. Free memory was 321.7MB in the beginning and 319.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 578.61ms. Allocated memory is still 398.5MB. Free memory was 319.6MB in the beginning and 296.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 854513.25ms. Allocated memory was 398.5MB in the beginning and 788.5MB in the end (delta: 390.1MB). Free memory was 295.5MB in the beginning and 382.0MB in the end (delta: -86.5MB). Peak memory consumption was 305.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 244]: Unsoundness Warning unspecified type, defaulting to int C: short [244] - GenericResultAtLocation [Line: 736]: Unsoundness Warning unspecified type, defaulting to int C: unsigned short [736] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 195 PlacesBefore, 72 PlacesAfterwards, 227 TransitionsBefore, 96 TransitionsAfterwards, 17762 CoEnabledTransitionPairs, 6 FixpointIterations, 29 TrivialSequentialCompositions, 147 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 27 ConcurrentYvCompositions, 8 ChoiceCompositions, 213 TotalNumberOfCompositions, 32876 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 18030, independent: 17678, independent conditional: 0, independent unconditional: 17678, dependent: 352, dependent conditional: 0, dependent unconditional: 352, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 9530, independent: 9447, independent conditional: 0, independent unconditional: 9447, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 18030, independent: 8231, independent conditional: 0, independent unconditional: 8231, dependent: 269, dependent conditional: 0, dependent unconditional: 269, unknown: 9530, unknown conditional: 0, unknown unconditional: 9530] , Statistics on independence cache: Total cache size (in pairs): 573, Positive cache size: 537, Positive conditional cache size: 0, Positive unconditional cache size: 537, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 262 locations, 38 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: 854.4s, OverallIterations: 17, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 554.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 75 mSolverCounterUnknown, 3257 SdHoareTripleChecker+Valid, 131.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3257 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 130.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4290 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4942 IncrementalHoareTripleChecker+Invalid, 9708 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 400 mSolverCounterUnsat, 3 mSDtfsCounter, 4942 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 900 GetRequests, 504 SyntacticMatches, 39 SemanticMatches, 357 ConstructedPredicates, 33 IntricatePredicates, 6 DeprecatedPredicates, 3093 ImplicationChecksByTransitivity, 695.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2841occurred in iteration=16, InterpolantAutomatonStates: 151, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 292.2s InterpolantComputationTime, 717 NumberOfCodeBlocks, 711 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 997 ConstructedInterpolants, 324 QuantifiedInterpolants, 42263 SizeOfPredicates, 90 NumberOfNonLiveVariables, 2753 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 39 InterpolantComputations, 6 PerfectInterpolantSequences, 1791/2081 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