./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_label41+token_ring.09.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_label41+token_ring.09.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 0e78e762388a6c3c1086d6b78561f9d228d7d6651a9ae559f7246d5d2e2293d4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 04:21:19,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 04:21:19,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 04:21:19,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 04:21:19,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 04:21:19,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 04:21:19,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 04:21:19,187 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 04:21:19,188 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 04:21:19,189 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 04:21:19,189 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 04:21:19,189 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 04:21:19,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 04:21:19,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 04:21:19,191 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 04:21:19,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 04:21:19,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 04:21:19,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 04:21:19,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 04:21:19,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 04:21:19,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 04:21:19,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 04:21:19,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 04:21:19,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 04:21:19,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 04:21:19,197 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 04:21:19,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 04:21:19,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 04:21:19,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 04:21:19,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 04:21:19,198 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 04:21:19,198 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 04:21:19,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:21:19,199 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 04:21:19,199 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 04:21:19,199 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 04:21:19,199 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 04:21:19,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 04:21:19,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 04:21:19,200 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 04:21:19,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 04:21:19,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 04:21:19,202 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 -> 0e78e762388a6c3c1086d6b78561f9d228d7d6651a9ae559f7246d5d2e2293d4 [2024-10-14 04:21:19,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 04:21:19,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 04:21:19,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 04:21:19,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 04:21:19,464 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 04:21:19,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.09.cil-1.c [2024-10-14 04:21:20,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 04:21:21,400 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 04:21:21,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.09.cil-1.c [2024-10-14 04:21:21,449 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731d628d3/baae86c6385f4f838b3a1fd22dacadfd/FLAG0d7801563 [2024-10-14 04:21:21,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/731d628d3/baae86c6385f4f838b3a1fd22dacadfd [2024-10-14 04:21:21,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 04:21:21,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 04:21:21,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 04:21:21,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 04:21:21,475 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 04:21:21,475 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:21:21" (1/1) ... [2024-10-14 04:21:21,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2031737e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:21, skipping insertion in model container [2024-10-14 04:21:21,478 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:21:21" (1/1) ... [2024-10-14 04:21:21,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 04:21:22,796 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_label41+token_ring.09.cil-1.c[376251,376264] [2024-10-14 04:21:22,826 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_label41+token_ring.09.cil-1.c[383339,383352] [2024-10-14 04:21:23,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:21:23,027 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 04:21:23,614 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_label41+token_ring.09.cil-1.c[376251,376264] [2024-10-14 04:21:23,621 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_label41+token_ring.09.cil-1.c[383339,383352] [2024-10-14 04:21:23,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 04:21:23,687 INFO L204 MainTranslator]: Completed translation [2024-10-14 04:21:23,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23 WrapperNode [2024-10-14 04:21:23,687 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 04:21:23,688 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 04:21:23,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 04:21:23,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 04:21:23,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:23,757 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,041 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-10-14 04:21:24,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 04:21:24,042 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 04:21:24,042 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 04:21:24,043 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 04:21:24,051 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,051 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,090 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,145 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-14 04:21:24,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,541 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 04:21:24,724 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 04:21:24,724 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 04:21:24,724 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 04:21:24,725 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (1/1) ... [2024-10-14 04:21:24,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 04:21:24,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 04:21:24,755 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-14 04:21:24,757 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-14 04:21:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 04:21:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-14 04:21:24,797 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-14 04:21:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-14 04:21:24,797 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-14 04:21:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-14 04:21:24,797 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-14 04:21:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-14 04:21:24,797 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-14 04:21:24,797 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-14 04:21:24,798 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-14 04:21:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-14 04:21:24,798 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-14 04:21:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 04:21:24,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 04:21:24,798 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 04:21:24,910 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 04:21:24,912 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 04:21:31,149 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-10-14 04:21:31,152 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 04:21:31,299 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 04:21:31,300 INFO L314 CfgBuilder]: Removed 13 assume(true) statements. [2024-10-14 04:21:31,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:21:31 BoogieIcfgContainer [2024-10-14 04:21:31,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 04:21:31,302 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 04:21:31,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 04:21:31,305 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 04:21:31,305 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:21:21" (1/3) ... [2024-10-14 04:21:31,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438aff9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:21:31, skipping insertion in model container [2024-10-14 04:21:31,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:21:23" (2/3) ... [2024-10-14 04:21:31,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438aff9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:21:31, skipping insertion in model container [2024-10-14 04:21:31,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:21:31" (3/3) ... [2024-10-14 04:21:31,307 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.09.cil-1.c [2024-10-14 04:21:31,320 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 04:21:31,320 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 04:21:31,414 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 04:21:31,419 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;@58985926, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 04:21:31,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 04:21:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 04:21:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:31,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:31,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:31,446 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:31,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:31,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1643509846, now seen corresponding path program 1 times [2024-10-14 04:21:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:31,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860823147] [2024-10-14 04:21:31,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:31,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:31,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:31,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:31,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:31,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:31,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:31,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:31,951 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-14 04:21:31,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:31,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860823147] [2024-10-14 04:21:31,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860823147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:31,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:31,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 04:21:31,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301964814] [2024-10-14 04:21:31,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:31,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 04:21:31,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:31,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 04:21:31,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 04:21:31,989 INFO L87 Difference]: Start difference. First operand has 2402 states, 2370 states have (on average 1.8784810126582279) internal successors, (4452), 2373 states have internal predecessors, (4452), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 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-14 04:21:33,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:33,736 INFO L93 Difference]: Finished difference Result 4898 states and 9162 transitions. [2024-10-14 04:21:33,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 04:21:33,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:33,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:33,771 INFO L225 Difference]: With dead ends: 4898 [2024-10-14 04:21:33,771 INFO L226 Difference]: Without dead ends: 2498 [2024-10-14 04:21:33,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 04:21:33,781 INFO L432 NwaCegarLoop]: 4200 mSDtfsCounter, 764 mSDsluCounter, 12138 mSDsCounter, 0 mSdLazyCounter, 836 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 16338 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:33,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 16338 Invalid, 886 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 836 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 04:21:33,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2498 states. [2024-10-14 04:21:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2498 to 2398. [2024-10-14 04:21:33,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2398 states, 2367 states have (on average 1.8411491339247994) internal successors, (4358), 2369 states have internal predecessors, (4358), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 04:21:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 4404 transitions. [2024-10-14 04:21:33,890 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 4404 transitions. Word has length 131 [2024-10-14 04:21:33,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:33,891 INFO L471 AbstractCegarLoop]: Abstraction has 2398 states and 4404 transitions. [2024-10-14 04:21:33,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 3 states have internal predecessors, (121), 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-14 04:21:33,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 4404 transitions. [2024-10-14 04:21:33,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:33,894 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:33,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:33,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 04:21:33,895 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:33,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:33,895 INFO L85 PathProgramCache]: Analyzing trace with hash 406899052, now seen corresponding path program 1 times [2024-10-14 04:21:33,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:33,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950719530] [2024-10-14 04:21:33,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:33,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:33,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:33,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:34,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:34,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:34,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:34,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:34,184 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-14 04:21:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:34,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950719530] [2024-10-14 04:21:34,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950719530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:34,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:34,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 04:21:34,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317314723] [2024-10-14 04:21:34,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:34,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 04:21:34,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:34,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 04:21:34,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 04:21:34,187 INFO L87 Difference]: Start difference. First operand 2398 states and 4404 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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-14 04:21:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:36,082 INFO L93 Difference]: Finished difference Result 3135 states and 5628 transitions. [2024-10-14 04:21:36,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 04:21:36,082 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:36,092 INFO L225 Difference]: With dead ends: 3135 [2024-10-14 04:21:36,092 INFO L226 Difference]: Without dead ends: 2873 [2024-10-14 04:21:36,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:21:36,094 INFO L432 NwaCegarLoop]: 4171 mSDtfsCounter, 5107 mSDsluCounter, 12498 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5123 SdHoareTripleChecker+Valid, 16669 SdHoareTripleChecker+Invalid, 1887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:36,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5123 Valid, 16669 Invalid, 1887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 04:21:36,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2024-10-14 04:21:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2674. [2024-10-14 04:21:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2618 states have (on average 1.8216195569136746) internal successors, (4769), 2621 states have internal predecessors, (4769), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-10-14 04:21:36,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 4854 transitions. [2024-10-14 04:21:36,150 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 4854 transitions. Word has length 131 [2024-10-14 04:21:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:36,151 INFO L471 AbstractCegarLoop]: Abstraction has 2674 states and 4854 transitions. [2024-10-14 04:21:36,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 4 states have internal predecessors, (121), 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-14 04:21:36,151 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 4854 transitions. [2024-10-14 04:21:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:36,153 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:36,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:36,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 04:21:36,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:36,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:36,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1501391760, now seen corresponding path program 1 times [2024-10-14 04:21:36,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:36,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280662420] [2024-10-14 04:21:36,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:36,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:36,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:36,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:36,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:36,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:36,423 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-14 04:21:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280662420] [2024-10-14 04:21:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280662420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:36,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:36,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:36,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129711594] [2024-10-14 04:21:36,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:36,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:36,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:36,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:36,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:36,426 INFO L87 Difference]: Start difference. First operand 2674 states and 4854 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:39,141 INFO L93 Difference]: Finished difference Result 3800 states and 6722 transitions. [2024-10-14 04:21:39,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:21:39,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:39,153 INFO L225 Difference]: With dead ends: 3800 [2024-10-14 04:21:39,153 INFO L226 Difference]: Without dead ends: 3262 [2024-10-14 04:21:39,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:21:39,156 INFO L432 NwaCegarLoop]: 4330 mSDtfsCounter, 5140 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2910 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5156 SdHoareTripleChecker+Valid, 21376 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:39,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5156 Valid, 21376 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2910 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 04:21:39,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-10-14 04:21:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 2929. [2024-10-14 04:21:39,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8040730337078652) internal successors, (5138), 2852 states have internal predecessors, (5138), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 04:21:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5261 transitions. [2024-10-14 04:21:39,215 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5261 transitions. Word has length 131 [2024-10-14 04:21:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:39,216 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5261 transitions. [2024-10-14 04:21:39,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:39,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5261 transitions. [2024-10-14 04:21:39,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:39,217 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:39,218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:39,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 04:21:39,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:39,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:39,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1030035410, now seen corresponding path program 1 times [2024-10-14 04:21:39,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:39,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199851730] [2024-10-14 04:21:39,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:39,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:39,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:39,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:39,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:39,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:39,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:39,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:39,481 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-14 04:21:39,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:39,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199851730] [2024-10-14 04:21:39,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199851730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:39,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343382185] [2024-10-14 04:21:39,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:39,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:39,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:39,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:39,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:39,484 INFO L87 Difference]: Start difference. First operand 2929 states and 5261 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:40,768 INFO L93 Difference]: Finished difference Result 4067 states and 7159 transitions. [2024-10-14 04:21:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:21:40,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:40,786 INFO L225 Difference]: With dead ends: 4067 [2024-10-14 04:21:40,787 INFO L226 Difference]: Without dead ends: 3274 [2024-10-14 04:21:40,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:21:40,794 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4804 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4821 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:40,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4821 Valid, 20600 Invalid, 1543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:21:40,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2024-10-14 04:21:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 2929. [2024-10-14 04:21:40,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8030196629213484) internal successors, (5135), 2852 states have internal predecessors, (5135), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 04:21:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5258 transitions. [2024-10-14 04:21:40,881 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5258 transitions. Word has length 131 [2024-10-14 04:21:40,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:40,881 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5258 transitions. [2024-10-14 04:21:40,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:40,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5258 transitions. [2024-10-14 04:21:40,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:40,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:40,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:40,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 04:21:40,883 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:40,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:40,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1133581164, now seen corresponding path program 1 times [2024-10-14 04:21:40,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372102025] [2024-10-14 04:21:40,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:40,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:40,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:40,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:41,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:41,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:41,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:41,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:41,054 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-14 04:21:41,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:41,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372102025] [2024-10-14 04:21:41,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372102025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:41,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:41,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:41,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612644325] [2024-10-14 04:21:41,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:41,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:41,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:41,056 INFO L87 Difference]: Start difference. First operand 2929 states and 5258 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:42,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:42,304 INFO L93 Difference]: Finished difference Result 4063 states and 7142 transitions. [2024-10-14 04:21:42,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:21:42,305 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:42,314 INFO L225 Difference]: With dead ends: 4063 [2024-10-14 04:21:42,314 INFO L226 Difference]: Without dead ends: 3270 [2024-10-14 04:21:42,317 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-14 04:21:42,317 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4802 mSDsluCounter, 16442 mSDsCounter, 0 mSdLazyCounter, 1468 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 20600 SdHoareTripleChecker+Invalid, 1527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:42,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 20600 Invalid, 1527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1468 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:21:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states. [2024-10-14 04:21:42,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 2929. [2024-10-14 04:21:42,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8019662921348314) internal successors, (5132), 2852 states have internal predecessors, (5132), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 04:21:42,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5255 transitions. [2024-10-14 04:21:42,382 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5255 transitions. Word has length 131 [2024-10-14 04:21:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:42,383 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5255 transitions. [2024-10-14 04:21:42,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5255 transitions. [2024-10-14 04:21:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:42,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:42,384 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:42,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 04:21:42,385 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:42,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash 94996590, now seen corresponding path program 1 times [2024-10-14 04:21:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312634927] [2024-10-14 04:21:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:42,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:42,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:42,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:42,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:42,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:42,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:42,530 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-14 04:21:42,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:42,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312634927] [2024-10-14 04:21:42,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312634927] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:42,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:42,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:42,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157435291] [2024-10-14 04:21:42,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:42,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:42,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:42,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:42,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:42,532 INFO L87 Difference]: Start difference. First operand 2929 states and 5255 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:43,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:43,664 INFO L93 Difference]: Finished difference Result 4059 states and 7125 transitions. [2024-10-14 04:21:43,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:21:43,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:43,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:43,673 INFO L225 Difference]: With dead ends: 4059 [2024-10-14 04:21:43,674 INFO L226 Difference]: Without dead ends: 3266 [2024-10-14 04:21:43,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-14 04:21:43,676 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4919 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4936 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:43,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4936 Valid, 16513 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 04:21:43,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3266 states. [2024-10-14 04:21:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3266 to 2929. [2024-10-14 04:21:43,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2929 states, 2848 states have (on average 1.8009129213483146) internal successors, (5129), 2852 states have internal predecessors, (5129), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-10-14 04:21:43,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2929 states to 2929 states and 5252 transitions. [2024-10-14 04:21:43,737 INFO L78 Accepts]: Start accepts. Automaton has 2929 states and 5252 transitions. Word has length 131 [2024-10-14 04:21:43,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:43,737 INFO L471 AbstractCegarLoop]: Abstraction has 2929 states and 5252 transitions. [2024-10-14 04:21:43,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 2929 states and 5252 transitions. [2024-10-14 04:21:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:43,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:43,739 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:43,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 04:21:43,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:43,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1878168788, now seen corresponding path program 1 times [2024-10-14 04:21:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:43,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025087207] [2024-10-14 04:21:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:43,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:43,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:43,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:43,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:43,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:43,913 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-14 04:21:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:43,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025087207] [2024-10-14 04:21:43,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025087207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:43,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:43,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:43,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138636278] [2024-10-14 04:21:43,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:43,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:43,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:43,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:43,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:43,915 INFO L87 Difference]: Start difference. First operand 2929 states and 5252 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:46,072 INFO L93 Difference]: Finished difference Result 4761 states and 8249 transitions. [2024-10-14 04:21:46,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:21:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:46,086 INFO L225 Difference]: With dead ends: 4761 [2024-10-14 04:21:46,087 INFO L226 Difference]: Without dead ends: 3968 [2024-10-14 04:21:46,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:21:46,091 INFO L432 NwaCegarLoop]: 4180 mSDtfsCounter, 5191 mSDsluCounter, 16647 mSDsCounter, 0 mSdLazyCounter, 2352 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5207 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:46,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5207 Valid, 20827 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2352 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-14 04:21:46,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2024-10-14 04:21:46,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3452. [2024-10-14 04:21:46,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7705510388437218) internal successors, (5880), 3327 states have internal predecessors, (5880), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-14 04:21:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6083 transitions. [2024-10-14 04:21:46,173 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6083 transitions. Word has length 131 [2024-10-14 04:21:46,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:46,173 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6083 transitions. [2024-10-14 04:21:46,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6083 transitions. [2024-10-14 04:21:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:46,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:46,175 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:46,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 04:21:46,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:46,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash 274938030, now seen corresponding path program 1 times [2024-10-14 04:21:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:46,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991886] [2024-10-14 04:21:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:46,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:46,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:46,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:46,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:46,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:46,480 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-14 04:21:46,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:46,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991886] [2024-10-14 04:21:46,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991886] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:46,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:46,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:46,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256713395] [2024-10-14 04:21:46,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:46,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:46,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:46,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:46,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:46,484 INFO L87 Difference]: Start difference. First operand 3452 states and 6083 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:47,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:47,868 INFO L93 Difference]: Finished difference Result 5271 states and 9068 transitions. [2024-10-14 04:21:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 04:21:47,869 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:47,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:47,886 INFO L225 Difference]: With dead ends: 5271 [2024-10-14 04:21:47,886 INFO L226 Difference]: Without dead ends: 3955 [2024-10-14 04:21:47,891 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-14 04:21:47,891 INFO L432 NwaCegarLoop]: 4158 mSDtfsCounter, 4918 mSDsluCounter, 12355 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4935 SdHoareTripleChecker+Valid, 16513 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:47,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4935 Valid, 16513 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1286 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-14 04:21:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2024-10-14 04:21:48,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3452. [2024-10-14 04:21:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3321 states have (on average 1.7690454682324601) internal successors, (5875), 3327 states have internal predecessors, (5875), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-10-14 04:21:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 6078 transitions. [2024-10-14 04:21:48,034 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 6078 transitions. Word has length 131 [2024-10-14 04:21:48,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:48,035 INFO L471 AbstractCegarLoop]: Abstraction has 3452 states and 6078 transitions. [2024-10-14 04:21:48,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 6078 transitions. [2024-10-14 04:21:48,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:48,037 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:48,037 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:48,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 04:21:48,037 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:48,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash -348343572, now seen corresponding path program 1 times [2024-10-14 04:21:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456819461] [2024-10-14 04:21:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:48,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:48,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:48,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:48,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:48,304 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-14 04:21:48,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:48,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456819461] [2024-10-14 04:21:48,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456819461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:48,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:48,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:48,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315775484] [2024-10-14 04:21:48,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:48,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:48,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:48,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:48,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:48,306 INFO L87 Difference]: Start difference. First operand 3452 states and 6078 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:51,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:51,491 INFO L93 Difference]: Finished difference Result 6630 states and 11232 transitions. [2024-10-14 04:21:51,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:21:51,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:51,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:51,502 INFO L225 Difference]: With dead ends: 6630 [2024-10-14 04:21:51,502 INFO L226 Difference]: Without dead ends: 5314 [2024-10-14 04:21:51,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:21:51,505 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5105 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2776 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5121 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:51,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5121 Valid, 21374 Invalid, 2833 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2776 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 04:21:51,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5314 states. [2024-10-14 04:21:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5314 to 4498. [2024-10-14 04:21:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 4267 states have (on average 1.7265057417389267) internal successors, (7367), 4277 states have internal predecessors, (7367), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-10-14 04:21:51,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 7736 transitions. [2024-10-14 04:21:51,627 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 7736 transitions. Word has length 131 [2024-10-14 04:21:51,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:51,627 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 7736 transitions. [2024-10-14 04:21:51,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:51,627 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 7736 transitions. [2024-10-14 04:21:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:51,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:51,629 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:51,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 04:21:51,629 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:51,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:51,630 INFO L85 PathProgramCache]: Analyzing trace with hash -229902098, now seen corresponding path program 1 times [2024-10-14 04:21:51,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:51,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082328763] [2024-10-14 04:21:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:51,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:51,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:51,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:51,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:51,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:51,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:51,783 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-14 04:21:51,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:51,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082328763] [2024-10-14 04:21:51,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082328763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:51,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:51,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420462219] [2024-10-14 04:21:51,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:51,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:51,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:51,784 INFO L87 Difference]: Start difference. First operand 4498 states and 7736 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:54,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:54,304 INFO L93 Difference]: Finished difference Result 10374 states and 17252 transitions. [2024-10-14 04:21:54,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 04:21:54,304 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:54,322 INFO L225 Difference]: With dead ends: 10374 [2024-10-14 04:21:54,323 INFO L226 Difference]: Without dead ends: 8012 [2024-10-14 04:21:54,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-14 04:21:54,329 INFO L432 NwaCegarLoop]: 4328 mSDtfsCounter, 5110 mSDsluCounter, 17046 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5126 SdHoareTripleChecker+Valid, 21374 SdHoareTripleChecker+Invalid, 2815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:54,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5126 Valid, 21374 Invalid, 2815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:21:54,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8012 states. [2024-10-14 04:21:54,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8012 to 6595. [2024-10-14 04:21:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6595 states, 6164 states have (on average 1.6802401038286827) internal successors, (10357), 6182 states have internal predecessors, (10357), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-10-14 04:21:54,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6595 states to 6595 states and 11076 transitions. [2024-10-14 04:21:54,830 INFO L78 Accepts]: Start accepts. Automaton has 6595 states and 11076 transitions. Word has length 131 [2024-10-14 04:21:54,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:54,830 INFO L471 AbstractCegarLoop]: Abstraction has 6595 states and 11076 transitions. [2024-10-14 04:21:54,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 6595 states and 11076 transitions. [2024-10-14 04:21:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:54,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:54,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:54,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 04:21:54,835 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:54,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:54,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1159391916, now seen corresponding path program 1 times [2024-10-14 04:21:54,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:54,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775309395] [2024-10-14 04:21:54,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:54,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:54,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:54,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:54,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:54,999 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-14 04:21:54,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:55,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775309395] [2024-10-14 04:21:55,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775309395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:55,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:55,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:55,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430553299] [2024-10-14 04:21:55,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:55,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:55,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:55,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:55,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:55,001 INFO L87 Difference]: Start difference. First operand 6595 states and 11076 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:21:58,361 INFO L93 Difference]: Finished difference Result 19523 states and 32052 transitions. [2024-10-14 04:21:58,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:21:58,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:21:58,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:21:58,400 INFO L225 Difference]: With dead ends: 19523 [2024-10-14 04:21:58,400 INFO L226 Difference]: Without dead ends: 15064 [2024-10-14 04:21:58,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:21:58,413 INFO L432 NwaCegarLoop]: 4325 mSDtfsCounter, 5178 mSDsluCounter, 17038 mSDsCounter, 0 mSdLazyCounter, 3229 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5193 SdHoareTripleChecker+Valid, 21363 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 04:21:58,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5193 Valid, 21363 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3229 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 04:21:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15064 states. [2024-10-14 04:21:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15064 to 10709. [2024-10-14 04:21:58,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10709 states, 9894 states have (on average 1.6423084697796644) internal successors, (16249), 9928 states have internal predecessors, (16249), 583 states have call successors, (583), 198 states have call predecessors, (583), 230 states have return successors, (858), 614 states have call predecessors, (858), 583 states have call successors, (858) [2024-10-14 04:21:58,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10709 states to 10709 states and 17690 transitions. [2024-10-14 04:21:58,845 INFO L78 Accepts]: Start accepts. Automaton has 10709 states and 17690 transitions. Word has length 131 [2024-10-14 04:21:58,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:21:58,845 INFO L471 AbstractCegarLoop]: Abstraction has 10709 states and 17690 transitions. [2024-10-14 04:21:58,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:21:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 10709 states and 17690 transitions. [2024-10-14 04:21:58,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:21:58,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:21:58,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:21:58,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 04:21:58,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:21:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:21:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -707316758, now seen corresponding path program 1 times [2024-10-14 04:21:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:21:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629900650] [2024-10-14 04:21:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:21:58,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:21:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:21:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:58,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:21:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:21:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:59,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:21:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:59,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:21:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:21:59,021 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-14 04:21:59,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:21:59,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629900650] [2024-10-14 04:21:59,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629900650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:21:59,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:21:59,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:21:59,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894078598] [2024-10-14 04:21:59,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:21:59,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:21:59,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:21:59,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:21:59,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:21:59,023 INFO L87 Difference]: Start difference. First operand 10709 states and 17690 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:22:03,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:03,016 INFO L93 Difference]: Finished difference Result 35491 states and 58044 transitions. [2024-10-14 04:22:03,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:22:03,017 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:22:03,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:03,080 INFO L225 Difference]: With dead ends: 35491 [2024-10-14 04:22:03,081 INFO L226 Difference]: Without dead ends: 26918 [2024-10-14 04:22:03,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:22:03,100 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5363 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2708 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5389 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:03,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5389 Valid, 21367 Invalid, 2768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2708 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:22:03,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26918 states. [2024-10-14 04:22:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26918 to 19014. [2024-10-14 04:22:04,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19014 states, 17447 states have (on average 1.6155786095030664) internal successors, (28187), 17513 states have internal predecessors, (28187), 1111 states have call successors, (1111), 390 states have call predecessors, (1111), 454 states have return successors, (1904), 1174 states have call predecessors, (1904), 1111 states have call successors, (1904) [2024-10-14 04:22:04,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19014 states to 19014 states and 31202 transitions. [2024-10-14 04:22:04,122 INFO L78 Accepts]: Start accepts. Automaton has 19014 states and 31202 transitions. Word has length 131 [2024-10-14 04:22:04,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:04,122 INFO L471 AbstractCegarLoop]: Abstraction has 19014 states and 31202 transitions. [2024-10-14 04:22:04,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:22:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 19014 states and 31202 transitions. [2024-10-14 04:22:04,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:22:04,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:04,130 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:22:04,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 04:22:04,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:04,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:04,131 INFO L85 PathProgramCache]: Analyzing trace with hash -2014459156, now seen corresponding path program 1 times [2024-10-14 04:22:04,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:04,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190313923] [2024-10-14 04:22:04,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:04,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:04,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:04,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:22:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:04,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:22:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:04,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:22:04,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:04,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:22:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:04,282 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-14 04:22:04,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:04,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190313923] [2024-10-14 04:22:04,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190313923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:04,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:04,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:04,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078900402] [2024-10-14 04:22:04,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:04,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:04,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:04,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:04,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:04,284 INFO L87 Difference]: Start difference. First operand 19014 states and 31202 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:22:09,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:09,386 INFO L93 Difference]: Finished difference Result 67154 states and 110194 transitions. [2024-10-14 04:22:09,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:22:09,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:22:09,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:09,558 INFO L225 Difference]: With dead ends: 67154 [2024-10-14 04:22:09,558 INFO L226 Difference]: Without dead ends: 50276 [2024-10-14 04:22:09,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:22:09,608 INFO L432 NwaCegarLoop]: 4326 mSDtfsCounter, 5327 mSDsluCounter, 17041 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5353 SdHoareTripleChecker+Valid, 21367 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:09,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5353 Valid, 21367 Invalid, 2755 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 04:22:09,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50276 states. [2024-10-14 04:22:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50276 to 35623. [2024-10-14 04:22:12,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35623 states, 32584 states have (on average 1.599711514853916) internal successors, (52125), 32714 states have internal predecessors, (52125), 2135 states have call successors, (2135), 774 states have call predecessors, (2135), 902 states have return successors, (4450), 2262 states have call predecessors, (4450), 2135 states have call successors, (4450) [2024-10-14 04:22:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35623 states to 35623 states and 58710 transitions. [2024-10-14 04:22:12,440 INFO L78 Accepts]: Start accepts. Automaton has 35623 states and 58710 transitions. Word has length 131 [2024-10-14 04:22:12,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:12,441 INFO L471 AbstractCegarLoop]: Abstraction has 35623 states and 58710 transitions. [2024-10-14 04:22:12,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:22:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 35623 states and 58710 transitions. [2024-10-14 04:22:12,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:22:12,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:12,458 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:22:12,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 04:22:12,458 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:12,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:12,459 INFO L85 PathProgramCache]: Analyzing trace with hash -116962390, now seen corresponding path program 1 times [2024-10-14 04:22:12,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:12,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116894703] [2024-10-14 04:22:12,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:12,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:12,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:22:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:22:12,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:22:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:22:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:12,608 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-14 04:22:12,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:12,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116894703] [2024-10-14 04:22:12,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116894703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:12,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:12,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:12,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595593504] [2024-10-14 04:22:12,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:12,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:12,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:12,610 INFO L87 Difference]: Start difference. First operand 35623 states and 58710 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:22:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 04:22:20,088 INFO L93 Difference]: Finished difference Result 129521 states and 214776 transitions. [2024-10-14 04:22:20,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-14 04:22:20,089 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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 131 [2024-10-14 04:22:20,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 04:22:20,694 INFO L225 Difference]: With dead ends: 129521 [2024-10-14 04:22:20,695 INFO L226 Difference]: Without dead ends: 96034 [2024-10-14 04:22:20,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-14 04:22:20,806 INFO L432 NwaCegarLoop]: 4182 mSDtfsCounter, 5211 mSDsluCounter, 16645 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5226 SdHoareTripleChecker+Valid, 20827 SdHoareTripleChecker+Invalid, 2734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 04:22:20,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5226 Valid, 20827 Invalid, 2734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 04:22:20,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96034 states. [2024-10-14 04:22:25,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96034 to 68840. [2024-10-14 04:22:25,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68840 states, 62921 states have (on average 1.5913129161965003) internal successors, (100127), 63179 states have internal predecessors, (100127), 4119 states have call successors, (4119), 1542 states have call predecessors, (4119), 1798 states have return successors, (10936), 4374 states have call predecessors, (10936), 4119 states have call successors, (10936) [2024-10-14 04:22:25,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68840 states to 68840 states and 115182 transitions. [2024-10-14 04:22:25,568 INFO L78 Accepts]: Start accepts. Automaton has 68840 states and 115182 transitions. Word has length 131 [2024-10-14 04:22:25,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 04:22:25,568 INFO L471 AbstractCegarLoop]: Abstraction has 68840 states and 115182 transitions. [2024-10-14 04:22:25,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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-14 04:22:25,569 INFO L276 IsEmpty]: Start isEmpty. Operand 68840 states and 115182 transitions. [2024-10-14 04:22:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-14 04:22:25,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 04:22:25,605 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 04:22:25,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 04:22:25,605 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 04:22:25,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 04:22:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 914078508, now seen corresponding path program 1 times [2024-10-14 04:22:25,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 04:22:25,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360041006] [2024-10-14 04:22:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 04:22:25,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 04:22:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 04:22:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-14 04:22:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:25,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 04:22:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-14 04:22:25,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:25,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 04:22:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 04:22:25,826 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-14 04:22:25,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 04:22:25,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360041006] [2024-10-14 04:22:25,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360041006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 04:22:25,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 04:22:25,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 04:22:25,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731133033] [2024-10-14 04:22:25,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 04:22:25,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 04:22:25,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 04:22:25,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 04:22:25,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 04:22:25,827 INFO L87 Difference]: Start difference. First operand 68840 states and 115182 transitions. Second operand has 7 states, 7 states have (on average 17.285714285714285) internal successors, (121), 5 states have internal predecessors, (121), 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)