./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 02:10:15,102 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 02:10:15,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 02:10:15,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 02:10:15,178 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 02:10:15,201 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 02:10:15,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 02:10:15,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 02:10:15,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 02:10:15,205 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 02:10:15,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 02:10:15,206 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 02:10:15,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 02:10:15,206 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 02:10:15,207 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 02:10:15,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 02:10:15,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 02:10:15,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 02:10:15,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 02:10:15,211 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 02:10:15,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 02:10:15,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 02:10:15,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 02:10:15,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 02:10:15,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 02:10:15,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 02:10:15,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 02:10:15,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 02:10:15,212 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 02:10:15,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 02:10:15,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 02:10:15,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 02:10:15,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:10:15,213 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 02:10:15,213 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 02:10:15,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 02:10:15,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 02:10:15,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 02:10:15,214 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 02:10:15,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 02:10:15,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 02:10:15,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 02:10:15,215 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d82b800c515c04812d9c150cf365a0cfa0ea150fbe8533e2e65b2216ea091fd6 [2024-10-24 02:10:15,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 02:10:15,469 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 02:10:15,472 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 02:10:15,473 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 02:10:15,474 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 02:10:15,475 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2024-10-24 02:10:16,803 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 02:10:17,425 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 02:10:17,426 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c [2024-10-24 02:10:17,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766066209/34d92199fddd45e08b699abb418652e0/FLAG9432359ea [2024-10-24 02:10:17,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766066209/34d92199fddd45e08b699abb418652e0 [2024-10-24 02:10:17,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 02:10:17,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 02:10:17,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 02:10:17,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 02:10:17,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 02:10:17,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:10:17" (1/1) ... [2024-10-24 02:10:17,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@793eee08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:17, skipping insertion in model container [2024-10-24 02:10:17,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 02:10:17" (1/1) ... [2024-10-24 02:10:17,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 02:10:18,926 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[377069,377082] [2024-10-24 02:10:18,961 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[383339,383352] [2024-10-24 02:10:19,188 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:10:19,199 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 02:10:19,781 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[377069,377082] [2024-10-24 02:10:19,787 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.08.cil-1.c[383339,383352] [2024-10-24 02:10:19,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 02:10:19,900 INFO L204 MainTranslator]: Completed translation [2024-10-24 02:10:19,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19 WrapperNode [2024-10-24 02:10:19,901 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 02:10:19,903 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 02:10:19,903 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 02:10:19,903 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 02:10:19,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,305 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12993 [2024-10-24 02:10:20,306 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 02:10:20,306 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 02:10:20,307 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 02:10:20,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 02:10:20,320 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,464 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 02:10:20,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,790 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,863 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,910 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:20,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:21,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 02:10:21,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 02:10:21,073 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 02:10:21,073 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 02:10:21,074 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (1/1) ... [2024-10-24 02:10:21,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 02:10:21,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 02:10:21,131 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 02:10:21,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 02:10:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 02:10:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-24 02:10:21,181 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-24 02:10:21,181 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-24 02:10:21,183 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-24 02:10:21,183 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-24 02:10:21,183 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-24 02:10:21,183 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-24 02:10:21,183 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-24 02:10:21,183 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-24 02:10:21,183 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-24 02:10:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-24 02:10:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-24 02:10:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 02:10:21,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 02:10:21,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 02:10:21,274 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 02:10:21,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 02:10:27,229 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2024-10-24 02:10:27,229 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 02:10:27,344 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 02:10:27,344 INFO L314 CfgBuilder]: Removed 12 assume(true) statements. [2024-10-24 02:10:27,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:10:27 BoogieIcfgContainer [2024-10-24 02:10:27,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 02:10:27,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 02:10:27,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 02:10:27,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 02:10:27,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 02:10:17" (1/3) ... [2024-10-24 02:10:27,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4641a3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:10:27, skipping insertion in model container [2024-10-24 02:10:27,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 02:10:19" (2/3) ... [2024-10-24 02:10:27,351 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4641a3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 02:10:27, skipping insertion in model container [2024-10-24 02:10:27,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 02:10:27" (3/3) ... [2024-10-24 02:10:27,352 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.08.cil-1.c [2024-10-24 02:10:27,365 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 02:10:27,365 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-24 02:10:27,457 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 02:10:27,462 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@201994c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 02:10:27,463 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-24 02:10:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 02:10:27,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:27,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:27,490 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:27,490 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:27,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2060137260, now seen corresponding path program 1 times [2024-10-24 02:10:27,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:27,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404265674] [2024-10-24 02:10:27,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:27,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:27,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:27,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:27,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:27,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:27,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:27,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:27,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:27,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:27,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404265674] [2024-10-24 02:10:27,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404265674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:27,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:27,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 02:10:27,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533545826] [2024-10-24 02:10:27,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:27,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 02:10:27,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:28,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 02:10:28,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 02:10:28,012 INFO L87 Difference]: Start difference. First operand has 2379 states, 2348 states have (on average 1.8794718909710393) internal successors, (4413), 2351 states have internal predecessors, (4413), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:29,336 INFO L93 Difference]: Finished difference Result 4844 states and 9066 transitions. [2024-10-24 02:10:29,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 02:10:29,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:29,357 INFO L225 Difference]: With dead ends: 4844 [2024-10-24 02:10:29,358 INFO L226 Difference]: Without dead ends: 2465 [2024-10-24 02:10:29,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 02:10:29,366 INFO L432 NwaCegarLoop]: 4181 mSDtfsCounter, 695 mSDsluCounter, 12116 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 16297 SdHoareTripleChecker+Invalid, 806 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:29,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 16297 Invalid, 806 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 02:10:29,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2024-10-24 02:10:29,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2375. [2024-10-24 02:10:29,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2375 states, 2345 states have (on average 1.8426439232409382) internal successors, (4321), 2347 states have internal predecessors, (4321), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 02:10:29,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2375 states to 2375 states and 4365 transitions. [2024-10-24 02:10:29,463 INFO L78 Accepts]: Start accepts. Automaton has 2375 states and 4365 transitions. Word has length 121 [2024-10-24 02:10:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:29,463 INFO L471 AbstractCegarLoop]: Abstraction has 2375 states and 4365 transitions. [2024-10-24 02:10:29,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:29,464 INFO L276 IsEmpty]: Start isEmpty. Operand 2375 states and 4365 transitions. [2024-10-24 02:10:29,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:29,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:29,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:29,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 02:10:29,467 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:29,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash 58250990, now seen corresponding path program 1 times [2024-10-24 02:10:29,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:29,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489956158] [2024-10-24 02:10:29,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:29,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:29,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:29,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:29,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:29,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:29,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:29,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:29,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:29,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489956158] [2024-10-24 02:10:29,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489956158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:29,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:29,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 02:10:29,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432454956] [2024-10-24 02:10:29,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:29,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 02:10:29,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 02:10:29,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 02:10:29,737 INFO L87 Difference]: Start difference. First operand 2375 states and 4365 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:31,558 INFO L93 Difference]: Finished difference Result 3046 states and 5475 transitions. [2024-10-24 02:10:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 02:10:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:31,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:31,568 INFO L225 Difference]: With dead ends: 3046 [2024-10-24 02:10:31,568 INFO L226 Difference]: Without dead ends: 2806 [2024-10-24 02:10:31,569 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:10:31,570 INFO L432 NwaCegarLoop]: 4154 mSDtfsCounter, 4998 mSDsluCounter, 12445 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5013 SdHoareTripleChecker+Valid, 16599 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:31,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5013 Valid, 16599 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:10:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2806 states. [2024-10-24 02:10:31,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2806 to 2627. [2024-10-24 02:10:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2627 states, 2573 states have (on average 1.8239409249902838) internal successors, (4693), 2576 states have internal predecessors, (4693), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (42), 39 states have call predecessors, (42), 39 states have call successors, (42) [2024-10-24 02:10:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2627 states to 2627 states and 4774 transitions. [2024-10-24 02:10:31,619 INFO L78 Accepts]: Start accepts. Automaton has 2627 states and 4774 transitions. Word has length 121 [2024-10-24 02:10:31,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:31,620 INFO L471 AbstractCegarLoop]: Abstraction has 2627 states and 4774 transitions. [2024-10-24 02:10:31,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2627 states and 4774 transitions. [2024-10-24 02:10:31,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:31,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:31,622 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:31,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 02:10:31,622 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:31,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:31,623 INFO L85 PathProgramCache]: Analyzing trace with hash 603539502, now seen corresponding path program 1 times [2024-10-24 02:10:31,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:31,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951561958] [2024-10-24 02:10:31,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:31,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:31,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:31,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:31,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:31,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:31,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:31,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:31,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951561958] [2024-10-24 02:10:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951561958] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122631895] [2024-10-24 02:10:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:31,823 INFO L87 Difference]: Start difference. First operand 2627 states and 4774 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:34,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:34,160 INFO L93 Difference]: Finished difference Result 3651 states and 6465 transitions. [2024-10-24 02:10:34,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:10:34,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:34,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:34,171 INFO L225 Difference]: With dead ends: 3651 [2024-10-24 02:10:34,171 INFO L226 Difference]: Without dead ends: 3159 [2024-10-24 02:10:34,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:10:34,178 INFO L432 NwaCegarLoop]: 4300 mSDtfsCounter, 5019 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2638 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5034 SdHoareTripleChecker+Valid, 21241 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 2638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:34,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5034 Valid, 21241 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 2638 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 02:10:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3159 states. [2024-10-24 02:10:34,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3159 to 2860. [2024-10-24 02:10:34,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2860 states, 2782 states have (on average 1.8069734004313445) internal successors, (5027), 2786 states have internal predecessors, (5027), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (61), 57 states have call predecessors, (61), 56 states have call successors, (61) [2024-10-24 02:10:34,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2860 states to 2860 states and 5144 transitions. [2024-10-24 02:10:34,251 INFO L78 Accepts]: Start accepts. Automaton has 2860 states and 5144 transitions. Word has length 121 [2024-10-24 02:10:34,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:34,251 INFO L471 AbstractCegarLoop]: Abstraction has 2860 states and 5144 transitions. [2024-10-24 02:10:34,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:34,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2860 states and 5144 transitions. [2024-10-24 02:10:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:34,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:34,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:34,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 02:10:34,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:34,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:34,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1429854544, now seen corresponding path program 1 times [2024-10-24 02:10:34,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:34,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599513337] [2024-10-24 02:10:34,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:34,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:34,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:34,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:34,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:34,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:34,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599513337] [2024-10-24 02:10:34,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599513337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:34,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:34,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520207002] [2024-10-24 02:10:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:34,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:34,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:34,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:34,464 INFO L87 Difference]: Start difference. First operand 2860 states and 5144 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:36,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:36,496 INFO L93 Difference]: Finished difference Result 4537 states and 7907 transitions. [2024-10-24 02:10:36,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:10:36,497 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:36,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:36,507 INFO L225 Difference]: With dead ends: 4537 [2024-10-24 02:10:36,508 INFO L226 Difference]: Without dead ends: 3812 [2024-10-24 02:10:36,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:10:36,511 INFO L432 NwaCegarLoop]: 4163 mSDtfsCounter, 5097 mSDsluCounter, 16578 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5112 SdHoareTripleChecker+Valid, 20741 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:36,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5112 Valid, 20741 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:10:36,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2024-10-24 02:10:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3327. [2024-10-24 02:10:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7794439237738207) internal successors, (5696), 3207 states have internal predecessors, (5696), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-24 02:10:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5889 transitions. [2024-10-24 02:10:36,646 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5889 transitions. Word has length 121 [2024-10-24 02:10:36,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:36,647 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5889 transitions. [2024-10-24 02:10:36,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:36,647 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5889 transitions. [2024-10-24 02:10:36,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:36,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:36,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:36,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 02:10:36,650 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash 998404078, now seen corresponding path program 1 times [2024-10-24 02:10:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250141860] [2024-10-24 02:10:36,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:36,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:36,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:36,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:36,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:36,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:36,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:36,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:36,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:36,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250141860] [2024-10-24 02:10:36,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250141860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:36,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:36,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:36,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391255007] [2024-10-24 02:10:36,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:36,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:36,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:36,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:36,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:36,881 INFO L87 Difference]: Start difference. First operand 3327 states and 5889 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:38,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:38,152 INFO L93 Difference]: Finished difference Result 4994 states and 8645 transitions. [2024-10-24 02:10:38,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:10:38,153 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:38,166 INFO L225 Difference]: With dead ends: 4994 [2024-10-24 02:10:38,166 INFO L226 Difference]: Without dead ends: 3802 [2024-10-24 02:10:38,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:10:38,171 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4728 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4744 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:38,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4744 Valid, 20529 Invalid, 1398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 02:10:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2024-10-24 02:10:38,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3327. [2024-10-24 02:10:38,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7778819119025304) internal successors, (5691), 3207 states have internal predecessors, (5691), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-24 02:10:38,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5884 transitions. [2024-10-24 02:10:38,301 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5884 transitions. Word has length 121 [2024-10-24 02:10:38,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:38,302 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5884 transitions. [2024-10-24 02:10:38,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5884 transitions. [2024-10-24 02:10:38,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:38,304 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:38,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:38,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 02:10:38,305 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:38,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:38,305 INFO L85 PathProgramCache]: Analyzing trace with hash -308738320, now seen corresponding path program 1 times [2024-10-24 02:10:38,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:38,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424799294] [2024-10-24 02:10:38,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:38,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:38,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:38,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:38,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:38,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:38,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:38,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:38,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424799294] [2024-10-24 02:10:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424799294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:38,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:38,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065430375] [2024-10-24 02:10:38,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:38,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:38,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:38,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:38,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:38,498 INFO L87 Difference]: Start difference. First operand 3327 states and 5884 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:39,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:39,504 INFO L93 Difference]: Finished difference Result 4983 states and 8609 transitions. [2024-10-24 02:10:39,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:10:39,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:39,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:39,514 INFO L225 Difference]: With dead ends: 4983 [2024-10-24 02:10:39,514 INFO L226 Difference]: Without dead ends: 3791 [2024-10-24 02:10:39,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:10:39,517 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4833 mSDsluCounter, 12312 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4849 SdHoareTripleChecker+Valid, 16453 SdHoareTripleChecker+Invalid, 1265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:39,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4849 Valid, 16453 Invalid, 1265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 02:10:39,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3791 states. [2024-10-24 02:10:39,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3791 to 3327. [2024-10-24 02:10:39,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3327 states, 3201 states have (on average 1.7763199000312402) internal successors, (5686), 3207 states have internal predecessors, (5686), 90 states have call successors, (90), 30 states have call predecessors, (90), 34 states have return successors, (103), 93 states have call predecessors, (103), 90 states have call successors, (103) [2024-10-24 02:10:39,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3327 states to 3327 states and 5879 transitions. [2024-10-24 02:10:39,597 INFO L78 Accepts]: Start accepts. Automaton has 3327 states and 5879 transitions. Word has length 121 [2024-10-24 02:10:39,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:39,597 INFO L471 AbstractCegarLoop]: Abstraction has 3327 states and 5879 transitions. [2024-10-24 02:10:39,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:39,602 INFO L276 IsEmpty]: Start isEmpty. Operand 3327 states and 5879 transitions. [2024-10-24 02:10:39,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:39,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:39,603 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:39,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 02:10:39,603 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:39,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:39,604 INFO L85 PathProgramCache]: Analyzing trace with hash 722302578, now seen corresponding path program 1 times [2024-10-24 02:10:39,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:39,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899362716] [2024-10-24 02:10:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:39,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:39,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:39,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:39,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:39,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:39,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:39,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:39,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:39,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899362716] [2024-10-24 02:10:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899362716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:39,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562004536] [2024-10-24 02:10:39,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:39,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:39,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:39,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:39,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:39,770 INFO L87 Difference]: Start difference. First operand 3327 states and 5879 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:41,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:41,689 INFO L93 Difference]: Finished difference Result 6219 states and 10582 transitions. [2024-10-24 02:10:41,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:10:41,689 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:41,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:41,715 INFO L225 Difference]: With dead ends: 6219 [2024-10-24 02:10:41,716 INFO L226 Difference]: Without dead ends: 5027 [2024-10-24 02:10:41,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:10:41,725 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 5002 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2559 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5017 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:41,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5017 Valid, 21239 Invalid, 2614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2559 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 02:10:41,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5027 states. [2024-10-24 02:10:41,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5027 to 4276. [2024-10-24 02:10:41,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.735816477553034) internal successors, (7037), 4064 states have internal predecessors, (7037), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-24 02:10:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7388 transitions. [2024-10-24 02:10:41,859 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7388 transitions. Word has length 121 [2024-10-24 02:10:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:41,860 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7388 transitions. [2024-10-24 02:10:41,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7388 transitions. [2024-10-24 02:10:41,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:41,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:41,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:41,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 02:10:41,863 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:41,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:41,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1184100688, now seen corresponding path program 1 times [2024-10-24 02:10:41,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:41,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564584399] [2024-10-24 02:10:41,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:41,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:41,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:41,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:42,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:42,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:42,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:42,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:42,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564584399] [2024-10-24 02:10:42,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564584399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:42,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:42,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763960625] [2024-10-24 02:10:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:42,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:42,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:42,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:42,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:42,059 INFO L87 Difference]: Start difference. First operand 4276 states and 7388 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:43,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:43,354 INFO L93 Difference]: Finished difference Result 7177 states and 12134 transitions. [2024-10-24 02:10:43,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 02:10:43,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:43,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:43,369 INFO L225 Difference]: With dead ends: 7177 [2024-10-24 02:10:43,370 INFO L226 Difference]: Without dead ends: 5036 [2024-10-24 02:10:43,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-24 02:10:43,376 INFO L432 NwaCegarLoop]: 4141 mSDtfsCounter, 4724 mSDsluCounter, 16388 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4740 SdHoareTripleChecker+Valid, 20529 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:43,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4740 Valid, 20529 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 02:10:43,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5036 states. [2024-10-24 02:10:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5036 to 4276. [2024-10-24 02:10:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4054 states have (on average 1.7335964479526393) internal successors, (7028), 4064 states have internal predecessors, (7028), 158 states have call successors, (158), 54 states have call predecessors, (158), 62 states have return successors, (193), 165 states have call predecessors, (193), 158 states have call successors, (193) [2024-10-24 02:10:43,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7379 transitions. [2024-10-24 02:10:43,505 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7379 transitions. Word has length 121 [2024-10-24 02:10:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:43,505 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7379 transitions. [2024-10-24 02:10:43,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:43,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7379 transitions. [2024-10-24 02:10:43,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:43,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:43,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:43,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 02:10:43,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:43,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:43,508 INFO L85 PathProgramCache]: Analyzing trace with hash 416970418, now seen corresponding path program 1 times [2024-10-24 02:10:43,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:43,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170337034] [2024-10-24 02:10:43,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:43,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:43,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:43,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:43,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:43,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:43,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:43,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:43,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170337034] [2024-10-24 02:10:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170337034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:43,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:43,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:43,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423628083] [2024-10-24 02:10:43,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:43,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:43,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:43,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:43,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:43,664 INFO L87 Difference]: Start difference. First operand 4276 states and 7379 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:45,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:45,823 INFO L93 Difference]: Finished difference Result 9610 states and 16003 transitions. [2024-10-24 02:10:45,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-24 02:10:45,823 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:45,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:45,847 INFO L225 Difference]: With dead ends: 9610 [2024-10-24 02:10:45,848 INFO L226 Difference]: Without dead ends: 7469 [2024-10-24 02:10:45,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-24 02:10:45,855 INFO L432 NwaCegarLoop]: 4298 mSDtfsCounter, 4994 mSDsluCounter, 16941 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5009 SdHoareTripleChecker+Valid, 21239 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:45,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5009 Valid, 21239 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 02:10:45,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2024-10-24 02:10:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 6184. [2024-10-24 02:10:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6184 states, 5770 states have (on average 1.6863084922010398) internal successors, (9730), 5788 states have internal predecessors, (9730), 294 states have call successors, (294), 102 states have call predecessors, (294), 118 states have return successors, (391), 309 states have call predecessors, (391), 294 states have call successors, (391) [2024-10-24 02:10:46,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6184 states to 6184 states and 10415 transitions. [2024-10-24 02:10:46,187 INFO L78 Accepts]: Start accepts. Automaton has 6184 states and 10415 transitions. Word has length 121 [2024-10-24 02:10:46,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:46,189 INFO L471 AbstractCegarLoop]: Abstraction has 6184 states and 10415 transitions. [2024-10-24 02:10:46,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:46,189 INFO L276 IsEmpty]: Start isEmpty. Operand 6184 states and 10415 transitions. [2024-10-24 02:10:46,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:46,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:46,194 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:46,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 02:10:46,195 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:46,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:46,195 INFO L85 PathProgramCache]: Analyzing trace with hash -639760784, now seen corresponding path program 1 times [2024-10-24 02:10:46,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:46,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960703619] [2024-10-24 02:10:46,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:46,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:46,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:46,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:46,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:46,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:46,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:46,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960703619] [2024-10-24 02:10:46,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960703619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:46,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:46,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:46,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939012225] [2024-10-24 02:10:46,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:46,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:46,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:46,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:46,374 INFO L87 Difference]: Start difference. First operand 6184 states and 10415 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:49,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:49,240 INFO L93 Difference]: Finished difference Result 18072 states and 29651 transitions. [2024-10-24 02:10:49,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:10:49,240 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:49,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:49,276 INFO L225 Difference]: With dead ends: 18072 [2024-10-24 02:10:49,276 INFO L226 Difference]: Without dead ends: 14023 [2024-10-24 02:10:49,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:10:49,288 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5287 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5311 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:49,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5311 Valid, 21232 Invalid, 2556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 02:10:49,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14023 states. [2024-10-24 02:10:49,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14023 to 9981. [2024-10-24 02:10:49,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9981 states, 9199 states have (on average 1.6453962387216001) internal successors, (15136), 9233 states have internal predecessors, (15136), 550 states have call successors, (550), 198 states have call predecessors, (550), 230 states have return successors, (825), 581 states have call predecessors, (825), 550 states have call successors, (825) [2024-10-24 02:10:49,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9981 states to 9981 states and 16511 transitions. [2024-10-24 02:10:49,679 INFO L78 Accepts]: Start accepts. Automaton has 9981 states and 16511 transitions. Word has length 121 [2024-10-24 02:10:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:49,679 INFO L471 AbstractCegarLoop]: Abstraction has 9981 states and 16511 transitions. [2024-10-24 02:10:49,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:49,680 INFO L276 IsEmpty]: Start isEmpty. Operand 9981 states and 16511 transitions. [2024-10-24 02:10:49,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:49,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:49,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:49,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 02:10:49,684 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:49,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 711624434, now seen corresponding path program 1 times [2024-10-24 02:10:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:49,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038204516] [2024-10-24 02:10:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:49,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:49,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:49,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:49,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:49,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:49,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038204516] [2024-10-24 02:10:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038204516] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243213401] [2024-10-24 02:10:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:49,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:49,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:49,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:49,830 INFO L87 Difference]: Start difference. First operand 9981 states and 16511 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:52,872 INFO L93 Difference]: Finished difference Result 32883 states and 53741 transitions. [2024-10-24 02:10:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:10:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:52,938 INFO L225 Difference]: With dead ends: 32883 [2024-10-24 02:10:52,938 INFO L226 Difference]: Without dead ends: 25037 [2024-10-24 02:10:52,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:10:52,960 INFO L432 NwaCegarLoop]: 4189 mSDtfsCounter, 5120 mSDsluCounter, 16600 mSDsCounter, 0 mSdLazyCounter, 2636 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5134 SdHoareTripleChecker+Valid, 20789 SdHoareTripleChecker+Invalid, 2715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:52,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5134 Valid, 20789 Invalid, 2715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2636 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-24 02:10:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25037 states. [2024-10-24 02:10:53,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25037 to 17414. [2024-10-24 02:10:53,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17414 states, 15912 states have (on average 1.6165158371040724) internal successors, (25722), 15978 states have internal predecessors, (25722), 1046 states have call successors, (1046), 390 states have call predecessors, (1046), 454 states have return successors, (1839), 1109 states have call predecessors, (1839), 1046 states have call successors, (1839) [2024-10-24 02:10:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17414 states to 17414 states and 28607 transitions. [2024-10-24 02:10:53,740 INFO L78 Accepts]: Start accepts. Automaton has 17414 states and 28607 transitions. Word has length 121 [2024-10-24 02:10:53,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:10:53,741 INFO L471 AbstractCegarLoop]: Abstraction has 17414 states and 28607 transitions. [2024-10-24 02:10:53,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 17414 states and 28607 transitions. [2024-10-24 02:10:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:10:53,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:10:53,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:10:53,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 02:10:53,751 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:10:53,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:10:53,752 INFO L85 PathProgramCache]: Analyzing trace with hash -907350480, now seen corresponding path program 1 times [2024-10-24 02:10:53,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:10:53,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083959712] [2024-10-24 02:10:53,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:10:53,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:10:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:53,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:10:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:53,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:10:53,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:10:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:53,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:10:53,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:10:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:10:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:10:53,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:10:53,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083959712] [2024-10-24 02:10:53,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083959712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:10:53,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:10:53,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:10:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619449807] [2024-10-24 02:10:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:10:53,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:10:53,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:10:53,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:10:53,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:10:53,887 INFO L87 Difference]: Start difference. First operand 17414 states and 28607 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:10:57,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:10:57,774 INFO L93 Difference]: Finished difference Result 61578 states and 100971 transitions. [2024-10-24 02:10:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:10:57,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:10:57,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:10:58,069 INFO L225 Difference]: With dead ends: 61578 [2024-10-24 02:10:58,069 INFO L226 Difference]: Without dead ends: 46299 [2024-10-24 02:10:58,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:10:58,159 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5221 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5245 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 02:10:58,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5245 Valid, 21232 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 02:10:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46299 states. [2024-10-24 02:10:59,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46299 to 32439. [2024-10-24 02:10:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32439 states, 29529 states have (on average 1.598835043516543) internal successors, (47212), 29659 states have internal predecessors, (47212), 2006 states have call successors, (2006), 774 states have call predecessors, (2006), 902 states have return successors, (4321), 2133 states have call predecessors, (4321), 2006 states have call successors, (4321) [2024-10-24 02:11:00,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32439 states to 32439 states and 53539 transitions. [2024-10-24 02:11:00,038 INFO L78 Accepts]: Start accepts. Automaton has 32439 states and 53539 transitions. Word has length 121 [2024-10-24 02:11:00,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 32439 states and 53539 transitions. [2024-10-24 02:11:00,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:11:00,039 INFO L276 IsEmpty]: Start isEmpty. Operand 32439 states and 53539 transitions. [2024-10-24 02:11:00,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:11:00,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:00,056 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:11:00,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 02:11:00,057 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:00,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:00,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1790859470, now seen corresponding path program 1 times [2024-10-24 02:11:00,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:00,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804402537] [2024-10-24 02:11:00,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:00,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:00,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:11:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:00,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:11:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:00,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:11:00,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:11:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:00,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804402537] [2024-10-24 02:11:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804402537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:00,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:00,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406937545] [2024-10-24 02:11:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:00,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:00,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:00,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:00,206 INFO L87 Difference]: Start difference. First operand 32439 states and 53539 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:11:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 02:11:07,774 INFO L93 Difference]: Finished difference Result 116759 states and 193853 transitions. [2024-10-24 02:11:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 02:11:07,775 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2024-10-24 02:11:07,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 02:11:08,100 INFO L225 Difference]: With dead ends: 116759 [2024-10-24 02:11:08,100 INFO L226 Difference]: Without dead ends: 86455 [2024-10-24 02:11:08,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-24 02:11:08,206 INFO L432 NwaCegarLoop]: 4296 mSDtfsCounter, 5030 mSDsluCounter, 16936 mSDsCounter, 0 mSdLazyCounter, 2755 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5044 SdHoareTripleChecker+Valid, 21232 SdHoareTripleChecker+Invalid, 2812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-24 02:11:08,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5044 Valid, 21232 Invalid, 2812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2755 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-24 02:11:08,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86455 states. [2024-10-24 02:11:12,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86455 to 62617. [2024-10-24 02:11:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62617 states, 56955 states have (on average 1.5903081380036872) internal successors, (90576), 57213 states have internal predecessors, (90576), 3862 states have call successors, (3862), 1542 states have call predecessors, (3862), 1798 states have return successors, (10679), 4117 states have call predecessors, (10679), 3862 states have call successors, (10679) [2024-10-24 02:11:12,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62617 states to 62617 states and 105117 transitions. [2024-10-24 02:11:12,950 INFO L78 Accepts]: Start accepts. Automaton has 62617 states and 105117 transitions. Word has length 121 [2024-10-24 02:11:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 02:11:12,951 INFO L471 AbstractCegarLoop]: Abstraction has 62617 states and 105117 transitions. [2024-10-24 02:11:12,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 02:11:12,951 INFO L276 IsEmpty]: Start isEmpty. Operand 62617 states and 105117 transitions. [2024-10-24 02:11:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-24 02:11:12,987 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 02:11:12,987 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 02:11:12,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 02:11:12,987 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 02:11:12,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 02:11:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash 563525812, now seen corresponding path program 1 times [2024-10-24 02:11:12,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 02:11:12,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987595673] [2024-10-24 02:11:12,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 02:11:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 02:11:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 02:11:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:13,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-24 02:11:13,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:13,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 02:11:13,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:13,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-24 02:11:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 02:11:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 02:11:13,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 02:11:13,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 02:11:13,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987595673] [2024-10-24 02:11:13,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987595673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 02:11:13,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 02:11:13,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-24 02:11:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749451839] [2024-10-24 02:11:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 02:11:13,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 02:11:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 02:11:13,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 02:11:13,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 02:11:13,188 INFO L87 Difference]: Start difference. First operand 62617 states and 105117 transitions. Second operand has 7 states, 7 states have (on average 15.857142857142858) internal successors, (111), 5 states have internal predecessors, (111), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)