./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.06.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.06.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 446a871a3cd47ea45eeb885eff35eb33cc93ddc5fa339490f1703fb03f5dc129 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 22:20:26,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 22:20:26,961 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 22:20:26,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 22:20:26,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 22:20:26,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 22:20:26,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 22:20:26,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 22:20:26,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 22:20:26,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 22:20:26,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 22:20:26,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 22:20:26,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 22:20:26,992 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 22:20:26,992 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 22:20:26,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 22:20:26,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 22:20:26,993 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 22:20:26,993 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 22:20:26,993 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 22:20:26,993 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 22:20:26,997 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 22:20:26,997 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 22:20:26,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 22:20:26,998 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 22:20:26,998 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 22:20:26,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 22:20:26,998 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 22:20:26,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 22:20:26,999 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 22:20:26,999 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 22:20:26,999 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 22:20:26,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:20:26,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 22:20:26,999 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 22:20:27,000 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 22:20:27,000 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 22:20:27,000 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 22:20:27,000 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 22:20:27,000 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 22:20:27,000 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 22:20:27,001 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 22:20:27,001 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 -> 446a871a3cd47ea45eeb885eff35eb33cc93ddc5fa339490f1703fb03f5dc129 [2024-11-11 22:20:27,183 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 22:20:27,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 22:20:27,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 22:20:27,211 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 22:20:27,211 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 22:20:27,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.06.cil-1.c [2024-11-11 22:20:28,620 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 22:20:29,209 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 22:20:29,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.06.cil-1.c [2024-11-11 22:20:29,255 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfca80ef/0e2d4b808c96440dae053a3d92b75662/FLAG26dac8cee [2024-11-11 22:20:29,278 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cfca80ef/0e2d4b808c96440dae053a3d92b75662 [2024-11-11 22:20:29,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 22:20:29,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 22:20:29,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 22:20:29,289 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 22:20:29,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 22:20:29,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:20:29" (1/1) ... [2024-11-11 22:20:29,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6a25d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:29, skipping insertion in model container [2024-11-11 22:20:29,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 10:20:29" (1/1) ... [2024-11-11 22:20:29,427 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 22:20:30,703 WARN L250 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_label49+token_ring.06.cil-1.c[380593,380606] [2024-11-11 22:20:30,726 WARN L250 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_label49+token_ring.06.cil-1.c[383339,383352] [2024-11-11 22:20:30,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:20:30,876 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 22:20:31,527 WARN L250 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_label49+token_ring.06.cil-1.c[380593,380606] [2024-11-11 22:20:31,531 WARN L250 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_label49+token_ring.06.cil-1.c[383339,383352] [2024-11-11 22:20:31,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 22:20:31,585 INFO L204 MainTranslator]: Completed translation [2024-11-11 22:20:31,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31 WrapperNode [2024-11-11 22:20:31,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 22:20:31,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 22:20:31,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 22:20:31,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 22:20:31,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:31,655 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:31,869 INFO L138 Inliner]: procedures = 56, calls = 60, calls flagged for inlining = 33, calls inlined = 33, statements flattened = 12879 [2024-11-11 22:20:31,870 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 22:20:31,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 22:20:31,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 22:20:31,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 22:20:31,880 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:31,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:31,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,150 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-11-11 22:20:32,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,155 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 22:20:32,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 22:20:32,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 22:20:32,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 22:20:32,509 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (1/1) ... [2024-11-11 22:20:32,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 22:20:32,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 22:20:32,541 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-11-11 22:20:32,546 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-11-11 22:20:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 22:20:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-11 22:20:32,598 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-11 22:20:32,598 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-11 22:20:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-11 22:20:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-11 22:20:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-11 22:20:32,600 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-11 22:20:32,600 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-11 22:20:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-11 22:20:32,601 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-11 22:20:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-11 22:20:32,601 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-11 22:20:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-11 22:20:32,601 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-11 22:20:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 22:20:32,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 22:20:32,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 22:20:32,704 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 22:20:32,706 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 22:20:39,637 INFO L? ?]: Removed 1723 outVars from TransFormulas that were not future-live. [2024-11-11 22:20:39,638 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 22:20:39,683 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 22:20:39,683 INFO L316 CfgBuilder]: Removed 10 assume(true) statements. [2024-11-11 22:20:39,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:20:39 BoogieIcfgContainer [2024-11-11 22:20:39,684 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 22:20:39,685 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 22:20:39,686 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 22:20:39,688 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 22:20:39,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 10:20:29" (1/3) ... [2024-11-11 22:20:39,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@effa7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:20:39, skipping insertion in model container [2024-11-11 22:20:39,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 10:20:31" (2/3) ... [2024-11-11 22:20:39,690 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@effa7e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 10:20:39, skipping insertion in model container [2024-11-11 22:20:39,690 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 10:20:39" (3/3) ... [2024-11-11 22:20:39,691 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.06.cil-1.c [2024-11-11 22:20:39,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 22:20:39,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-11 22:20:39,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 22:20:39,818 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;@26dc375c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 22:20:39,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-11 22:20:39,828 INFO L276 IsEmpty]: Start isEmpty. Operand has 2430 states, 2398 states have (on average 1.8490408673894911) internal successors, (4434), 2403 states have internal predecessors, (4434), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-11 22:20:39,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:39,839 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:39,839 INFO L218 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] [2024-11-11 22:20:39,840 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:39,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:39,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1522104214, now seen corresponding path program 1 times [2024-11-11 22:20:39,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:39,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750265541] [2024-11-11 22:20:39,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:39,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:39,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:40,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:40,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:40,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:40,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:40,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:40,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:40,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:40,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:40,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750265541] [2024-11-11 22:20:40,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750265541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:40,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:40,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-11 22:20:40,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115697985] [2024-11-11 22:20:40,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:40,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 22:20:40,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:40,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 22:20:40,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 22:20:40,407 INFO L87 Difference]: Start difference. First operand has 2430 states, 2398 states have (on average 1.8490408673894911) internal successors, (4434), 2403 states have internal predecessors, (4434), 22 states have call successors, (22), 7 states have call predecessors, (22), 7 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:41,320 INFO L93 Difference]: Finished difference Result 4925 states and 9068 transitions. [2024-11-11 22:20:41,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 22:20:41,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:20:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:41,339 INFO L225 Difference]: With dead ends: 4925 [2024-11-11 22:20:41,340 INFO L226 Difference]: Without dead ends: 2438 [2024-11-11 22:20:41,348 INFO L434 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-11-11 22:20:41,350 INFO L435 NwaCegarLoop]: 4256 mSDtfsCounter, 609 mSDsluCounter, 12341 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 16597 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:41,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 16597 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 22:20:41,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2024-11-11 22:20:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 2362. [2024-11-11 22:20:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2332 states have (on average 1.8366209262435678) internal successors, (4283), 2335 states have internal predecessors, (4283), 22 states have call successors, (22), 7 states have call predecessors, (22), 6 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-11 22:20:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 4325 transitions. [2024-11-11 22:20:41,496 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 4325 transitions. Word has length 113 [2024-11-11 22:20:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:41,496 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 4325 transitions. [2024-11-11 22:20:41,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.4) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 4325 transitions. [2024-11-11 22:20:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:41,503 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:41,503 INFO L218 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] [2024-11-11 22:20:41,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 22:20:41,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:41,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:41,504 INFO L85 PathProgramCache]: Analyzing trace with hash -375392552, now seen corresponding path program 1 times [2024-11-11 22:20:41,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:41,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396250930] [2024-11-11 22:20:41,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:41,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:41,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:41,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:41,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:41,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:41,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:41,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:41,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:41,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396250930] [2024-11-11 22:20:41,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396250930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:41,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:41,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:41,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633134334] [2024-11-11 22:20:41,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:41,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:41,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:41,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:41,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:41,796 INFO L87 Difference]: Start difference. First operand 2362 states and 4325 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:43,864 INFO L93 Difference]: Finished difference Result 2987 states and 5319 transitions. [2024-11-11 22:20:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:43,864 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:20:43,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:43,873 INFO L225 Difference]: With dead ends: 2987 [2024-11-11 22:20:43,873 INFO L226 Difference]: Without dead ends: 2760 [2024-11-11 22:20:43,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:43,875 INFO L435 NwaCegarLoop]: 4330 mSDtfsCounter, 4810 mSDsluCounter, 17084 mSDsCounter, 0 mSdLazyCounter, 2098 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4823 SdHoareTripleChecker+Valid, 21414 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:43,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4823 Valid, 21414 Invalid, 2156 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [58 Valid, 2098 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:20:43,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2024-11-11 22:20:43,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2597. [2024-11-11 22:20:43,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2597 states, 2542 states have (on average 1.8139260424862313) internal successors, (4611), 2547 states have internal predecessors, (4611), 39 states have call successors, (39), 13 states have call predecessors, (39), 14 states have return successors, (44), 38 states have call predecessors, (44), 37 states have call successors, (44) [2024-11-11 22:20:43,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2597 states to 2597 states and 4694 transitions. [2024-11-11 22:20:43,927 INFO L78 Accepts]: Start accepts. Automaton has 2597 states and 4694 transitions. Word has length 113 [2024-11-11 22:20:43,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:43,928 INFO L471 AbstractCegarLoop]: Abstraction has 2597 states and 4694 transitions. [2024-11-11 22:20:43,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:43,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2597 states and 4694 transitions. [2024-11-11 22:20:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:43,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:43,931 INFO L218 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] [2024-11-11 22:20:43,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 22:20:43,931 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:43,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:43,932 INFO L85 PathProgramCache]: Analyzing trace with hash 975992666, now seen corresponding path program 1 times [2024-11-11 22:20:43,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:43,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610052608] [2024-11-11 22:20:43,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:43,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:43,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:44,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:44,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:44,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:44,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:44,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:44,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:44,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:44,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:44,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:44,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610052608] [2024-11-11 22:20:44,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610052608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:44,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:44,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:44,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100740556] [2024-11-11 22:20:44,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:44,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:44,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:44,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:44,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:44,212 INFO L87 Difference]: Start difference. First operand 2597 states and 4694 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:45,956 INFO L93 Difference]: Finished difference Result 3782 states and 6562 transitions. [2024-11-11 22:20:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:45,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:20:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:45,969 INFO L225 Difference]: With dead ends: 3782 [2024-11-11 22:20:45,969 INFO L226 Difference]: Without dead ends: 3322 [2024-11-11 22:20:45,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:45,974 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4835 mSDsluCounter, 17021 mSDsCounter, 0 mSdLazyCounter, 1904 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4848 SdHoareTripleChecker+Valid, 21310 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:45,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4848 Valid, 21310 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1904 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:20:45,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2024-11-11 22:20:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 3031. [2024-11-11 22:20:46,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3031 states, 2932 states have (on average 1.776261937244202) internal successors, (5208), 2939 states have internal predecessors, (5208), 69 states have call successors, (69), 25 states have call predecessors, (69), 28 states have return successors, (84), 70 states have call predecessors, (84), 67 states have call successors, (84) [2024-11-11 22:20:46,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 5361 transitions. [2024-11-11 22:20:46,046 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 5361 transitions. Word has length 113 [2024-11-11 22:20:46,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:46,047 INFO L471 AbstractCegarLoop]: Abstraction has 3031 states and 5361 transitions. [2024-11-11 22:20:46,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:46,048 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 5361 transitions. [2024-11-11 22:20:46,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:46,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:46,051 INFO L218 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] [2024-11-11 22:20:46,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 22:20:46,051 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:46,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:46,052 INFO L85 PathProgramCache]: Analyzing trace with hash -642982248, now seen corresponding path program 1 times [2024-11-11 22:20:46,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:46,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594442997] [2024-11-11 22:20:46,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:46,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:46,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:46,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:46,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:46,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:46,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:46,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:46,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:46,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:46,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594442997] [2024-11-11 22:20:46,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594442997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:46,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:46,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:46,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496530849] [2024-11-11 22:20:46,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:46,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:46,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:46,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:46,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:46,202 INFO L87 Difference]: Start difference. First operand 3031 states and 5361 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:48,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:48,128 INFO L93 Difference]: Finished difference Result 5338 states and 8989 transitions. [2024-11-11 22:20:48,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:48,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:20:48,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:48,143 INFO L225 Difference]: With dead ends: 5338 [2024-11-11 22:20:48,143 INFO L226 Difference]: Without dead ends: 4444 [2024-11-11 22:20:48,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:48,147 INFO L435 NwaCegarLoop]: 4328 mSDtfsCounter, 4810 mSDsluCounter, 17084 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4823 SdHoareTripleChecker+Valid, 21412 SdHoareTripleChecker+Invalid, 2153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:48,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4823 Valid, 21412 Invalid, 2153 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [60 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:20:48,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4444 states. [2024-11-11 22:20:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4444 to 3901. [2024-11-11 22:20:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3901 states, 3714 states have (on average 1.7242864835756597) internal successors, (6404), 3725 states have internal predecessors, (6404), 129 states have call successors, (129), 49 states have call predecessors, (129), 56 states have return successors, (170), 134 states have call predecessors, (170), 127 states have call successors, (170) [2024-11-11 22:20:48,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3901 states to 3901 states and 6703 transitions. [2024-11-11 22:20:48,308 INFO L78 Accepts]: Start accepts. Automaton has 3901 states and 6703 transitions. Word has length 113 [2024-11-11 22:20:48,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:48,309 INFO L471 AbstractCegarLoop]: Abstraction has 3901 states and 6703 transitions. [2024-11-11 22:20:48,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 3901 states and 6703 transitions. [2024-11-11 22:20:48,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:48,311 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:48,311 INFO L218 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] [2024-11-11 22:20:48,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 22:20:48,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:48,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:48,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1526491238, now seen corresponding path program 1 times [2024-11-11 22:20:48,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:48,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913021969] [2024-11-11 22:20:48,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:48,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:48,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:48,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:48,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:48,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:48,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:48,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:48,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:48,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:48,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:48,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913021969] [2024-11-11 22:20:48,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913021969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:48,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776499514] [2024-11-11 22:20:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:48,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:48,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:48,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:48,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:48,490 INFO L87 Difference]: Start difference. First operand 3901 states and 6703 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:50,717 INFO L93 Difference]: Finished difference Result 8448 states and 13857 transitions. [2024-11-11 22:20:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:20:50,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:50,754 INFO L225 Difference]: With dead ends: 8448 [2024-11-11 22:20:50,758 INFO L226 Difference]: Without dead ends: 6684 [2024-11-11 22:20:50,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:50,766 INFO L435 NwaCegarLoop]: 4329 mSDtfsCounter, 4810 mSDsluCounter, 17084 mSDsCounter, 0 mSdLazyCounter, 2089 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4823 SdHoareTripleChecker+Valid, 21413 SdHoareTripleChecker+Invalid, 2149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:50,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4823 Valid, 21413 Invalid, 2149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2089 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:20:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6684 states. [2024-11-11 22:20:50,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6684 to 5647. [2024-11-11 22:20:50,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5647 states, 5284 states have (on average 1.6661619984859954) internal successors, (8804), 5303 states have internal predecessors, (8804), 249 states have call successors, (249), 97 states have call predecessors, (249), 112 states have return successors, (360), 262 states have call predecessors, (360), 247 states have call successors, (360) [2024-11-11 22:20:51,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5647 states to 5647 states and 9413 transitions. [2024-11-11 22:20:51,003 INFO L78 Accepts]: Start accepts. Automaton has 5647 states and 9413 transitions. Word has length 113 [2024-11-11 22:20:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:51,003 INFO L471 AbstractCegarLoop]: Abstraction has 5647 states and 9413 transitions. [2024-11-11 22:20:51,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 5647 states and 9413 transitions. [2024-11-11 22:20:51,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:51,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:51,007 INFO L218 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] [2024-11-11 22:20:51,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 22:20:51,008 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:51,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:51,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1554991528, now seen corresponding path program 1 times [2024-11-11 22:20:51,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:51,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751451777] [2024-11-11 22:20:51,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:51,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:51,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:51,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:51,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:51,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:51,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:51,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:51,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:51,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751451777] [2024-11-11 22:20:51,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751451777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:51,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:51,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:51,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652720474] [2024-11-11 22:20:51,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:51,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:51,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:51,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:51,168 INFO L87 Difference]: Start difference. First operand 5647 states and 9413 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:53,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:53,276 INFO L93 Difference]: Finished difference Result 14666 states and 23649 transitions. [2024-11-11 22:20:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:53,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:20:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:53,320 INFO L225 Difference]: With dead ends: 14666 [2024-11-11 22:20:53,320 INFO L226 Difference]: Without dead ends: 11156 [2024-11-11 22:20:53,335 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:53,335 INFO L435 NwaCegarLoop]: 4329 mSDtfsCounter, 4810 mSDsluCounter, 17084 mSDsCounter, 0 mSdLazyCounter, 2080 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4823 SdHoareTripleChecker+Valid, 21413 SdHoareTripleChecker+Invalid, 2140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2080 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:53,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4823 Valid, 21413 Invalid, 2140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2080 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 22:20:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11156 states. [2024-11-11 22:20:53,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11156 to 9153. [2024-11-11 22:20:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9153 states, 8438 states have (on average 1.6146006162597772) internal successors, (13624), 8473 states have internal predecessors, (13624), 489 states have call successors, (489), 193 states have call predecessors, (489), 224 states have return successors, (794), 518 states have call predecessors, (794), 487 states have call successors, (794) [2024-11-11 22:20:53,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9153 states to 9153 states and 14907 transitions. [2024-11-11 22:20:53,793 INFO L78 Accepts]: Start accepts. Automaton has 9153 states and 14907 transitions. Word has length 113 [2024-11-11 22:20:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:53,793 INFO L471 AbstractCegarLoop]: Abstraction has 9153 states and 14907 transitions. [2024-11-11 22:20:53,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 9153 states and 14907 transitions. [2024-11-11 22:20:53,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:53,799 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:53,799 INFO L218 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] [2024-11-11 22:20:53,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 22:20:53,800 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:53,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:53,800 INFO L85 PathProgramCache]: Analyzing trace with hash 799393754, now seen corresponding path program 1 times [2024-11-11 22:20:53,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:53,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086132886] [2024-11-11 22:20:53,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:53,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:53,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:53,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:53,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:53,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:53,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:53,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:53,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:53,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086132886] [2024-11-11 22:20:53,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086132886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:53,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:53,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:53,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32790451] [2024-11-11 22:20:53,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:53,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:53,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:53,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:53,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:53,926 INFO L87 Difference]: Start difference. First operand 9153 states and 14907 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:56,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:20:56,317 INFO L93 Difference]: Finished difference Result 27100 states and 43421 transitions. [2024-11-11 22:20:56,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 22:20:56,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:20:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:20:56,383 INFO L225 Difference]: With dead ends: 27100 [2024-11-11 22:20:56,383 INFO L226 Difference]: Without dead ends: 20084 [2024-11-11 22:20:56,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-11 22:20:56,409 INFO L435 NwaCegarLoop]: 4327 mSDtfsCounter, 4810 mSDsluCounter, 17084 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4823 SdHoareTripleChecker+Valid, 21411 SdHoareTripleChecker+Invalid, 2121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 22:20:56,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4823 Valid, 21411 Invalid, 2121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2061 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 22:20:56,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20084 states. [2024-11-11 22:20:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20084 to 16195. [2024-11-11 22:20:57,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16195 states, 14776 states have (on average 1.577422847861397) internal successors, (23308), 14843 states have internal predecessors, (23308), 969 states have call successors, (969), 385 states have call predecessors, (969), 448 states have return successors, (1824), 1030 states have call predecessors, (1824), 967 states have call successors, (1824) [2024-11-11 22:20:57,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16195 states to 16195 states and 26101 transitions. [2024-11-11 22:20:57,192 INFO L78 Accepts]: Start accepts. Automaton has 16195 states and 26101 transitions. Word has length 113 [2024-11-11 22:20:57,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:20:57,192 INFO L471 AbstractCegarLoop]: Abstraction has 16195 states and 26101 transitions. [2024-11-11 22:20:57,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:20:57,193 INFO L276 IsEmpty]: Start isEmpty. Operand 16195 states and 26101 transitions. [2024-11-11 22:20:57,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:20:57,204 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:20:57,204 INFO L218 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] [2024-11-11 22:20:57,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 22:20:57,204 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:20:57,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:20:57,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1618510312, now seen corresponding path program 1 times [2024-11-11 22:20:57,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:20:57,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860006092] [2024-11-11 22:20:57,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:20:57,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:20:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:20:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:57,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:20:57,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:57,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:20:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:57,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:20:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:57,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:20:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:20:57,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:20:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:20:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860006092] [2024-11-11 22:20:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860006092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:20:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:20:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:20:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159896134] [2024-11-11 22:20:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:20:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:20:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:20:57,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:20:57,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:20:57,374 INFO L87 Difference]: Start difference. First operand 16195 states and 26101 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:21:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:21:00,886 INFO L93 Difference]: Finished difference Result 57918 states and 92523 transitions. [2024-11-11 22:21:00,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:21:00,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:21:00,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:21:01,030 INFO L225 Difference]: With dead ends: 57918 [2024-11-11 22:21:01,030 INFO L226 Difference]: Without dead ends: 43860 [2024-11-11 22:21:01,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:21:01,084 INFO L435 NwaCegarLoop]: 4327 mSDtfsCounter, 5068 mSDsluCounter, 17076 mSDsCounter, 0 mSdLazyCounter, 2050 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5088 SdHoareTripleChecker+Valid, 21403 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 22:21:01,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5088 Valid, 21403 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2050 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 22:21:01,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43860 states. [2024-11-11 22:21:03,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43860 to 30149. [2024-11-11 22:21:03,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30149 states, 27386 states have (on average 1.5569999269699846) internal successors, (42640), 27517 states have internal predecessors, (42640), 1865 states have call successors, (1865), 769 states have call predecessors, (1865), 896 states have return successors, (4306), 1990 states have call predecessors, (4306), 1863 states have call successors, (4306) [2024-11-11 22:21:03,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30149 states to 30149 states and 48811 transitions. [2024-11-11 22:21:03,495 INFO L78 Accepts]: Start accepts. Automaton has 30149 states and 48811 transitions. Word has length 113 [2024-11-11 22:21:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:21:03,495 INFO L471 AbstractCegarLoop]: Abstraction has 30149 states and 48811 transitions. [2024-11-11 22:21:03,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:21:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 30149 states and 48811 transitions. [2024-11-11 22:21:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:21:03,513 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:21:03,513 INFO L218 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] [2024-11-11 22:21:03,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 22:21:03,513 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:21:03,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:21:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1905723418, now seen corresponding path program 1 times [2024-11-11 22:21:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:21:03,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030246239] [2024-11-11 22:21:03,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:21:03,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:21:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:03,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:21:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:21:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:03,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:21:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:03,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:21:03,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:03,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:21:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:03,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:21:03,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:21:03,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030246239] [2024-11-11 22:21:03,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030246239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:21:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:21:03,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:21:03,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738055148] [2024-11-11 22:21:03,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:21:03,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:21:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:21:03,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:21:03,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:21:03,689 INFO L87 Difference]: Start difference. First operand 30149 states and 48811 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:21:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 22:21:09,098 INFO L93 Difference]: Finished difference Result 109699 states and 177727 transitions. [2024-11-11 22:21:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-11 22:21:09,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 113 [2024-11-11 22:21:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 22:21:09,449 INFO L225 Difference]: With dead ends: 109699 [2024-11-11 22:21:09,449 INFO L226 Difference]: Without dead ends: 81687 [2024-11-11 22:21:09,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-11 22:21:09,538 INFO L435 NwaCegarLoop]: 4325 mSDtfsCounter, 5003 mSDsluCounter, 17076 mSDsCounter, 0 mSdLazyCounter, 1985 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5023 SdHoareTripleChecker+Valid, 21401 SdHoareTripleChecker+Invalid, 2048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-11 22:21:09,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5023 Valid, 21401 Invalid, 2048 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [63 Valid, 1985 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-11 22:21:09,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81687 states. [2024-11-11 22:21:12,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81687 to 58119. [2024-11-11 22:21:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58119 states, 52732 states have (on average 1.547826746567549) internal successors, (81620), 52991 states have internal predecessors, (81620), 3593 states have call successors, (3593), 1537 states have call predecessors, (3593), 1792 states have return successors, (10664), 3846 states have call predecessors, (10664), 3591 states have call successors, (10664) [2024-11-11 22:21:13,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58119 states to 58119 states and 95877 transitions. [2024-11-11 22:21:13,232 INFO L78 Accepts]: Start accepts. Automaton has 58119 states and 95877 transitions. Word has length 113 [2024-11-11 22:21:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 22:21:13,233 INFO L471 AbstractCegarLoop]: Abstraction has 58119 states and 95877 transitions. [2024-11-11 22:21:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-11 22:21:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 58119 states and 95877 transitions. [2024-11-11 22:21:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 22:21:13,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 22:21:13,275 INFO L218 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] [2024-11-11 22:21:13,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 22:21:13,277 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 22:21:13,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 22:21:13,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1319447196, now seen corresponding path program 1 times [2024-11-11 22:21:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 22:21:13,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58588750] [2024-11-11 22:21:13,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 22:21:13,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 22:21:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:13,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-11 22:21:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:13,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-11 22:21:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-11 22:21:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 22:21:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 22:21:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 22:21:13,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 22:21:13,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 22:21:13,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58588750] [2024-11-11 22:21:13,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58588750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 22:21:13,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 22:21:13,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 22:21:13,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44982808] [2024-11-11 22:21:13,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 22:21:13,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 22:21:13,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 22:21:13,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 22:21:13,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 22:21:13,480 INFO L87 Difference]: Start difference. First operand 58119 states and 95877 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 5 states have internal predecessors, (102), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)