./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 bd23dfa6335616d8eec5b9783c1f6df5ab0e74e3c379835195329e627de34889 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 04:10:48,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 04:10:48,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 04:10:48,909 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 04:10:48,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 04:10:48,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 04:10:48,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 04:10:48,948 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 04:10:48,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 04:10:48,949 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 04:10:48,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 04:10:48,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 04:10:48,950 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 04:10:48,950 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 04:10:48,951 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 04:10:48,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 04:10:48,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 04:10:48,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 04:10:48,957 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 04:10:48,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 04:10:48,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 04:10:48,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 04:10:48,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 04:10:48,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 04:10:48,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 04:10:48,961 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 04:10:48,961 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 04:10:48,961 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 04:10:48,962 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 04:10:48,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 04:10:48,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 04:10:48,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 04:10:48,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:10:48,964 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 04:10:48,964 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 04:10:48,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 04:10:48,965 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 04:10:48,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 04:10:48,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 04:10:48,966 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 04:10:48,966 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 04:10:48,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 04:10:48,966 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-clean/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-clean/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 -> bd23dfa6335616d8eec5b9783c1f6df5ab0e74e3c379835195329e627de34889 [2024-10-11 04:10:49,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 04:10:49,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 04:10:49,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 04:10:49,275 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 04:10:49,275 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 04:10:49,277 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c [2024-10-11 04:10:50,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 04:10:51,348 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 04:10:51,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c [2024-10-11 04:10:51,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/902ed6351/b404945cb2a6484f9cd4f35a91ddfa79/FLAG85390f99d [2024-10-11 04:10:51,816 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/902ed6351/b404945cb2a6484f9cd4f35a91ddfa79 [2024-10-11 04:10:51,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 04:10:51,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 04:10:51,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 04:10:51,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 04:10:51,827 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 04:10:51,827 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:10:51" (1/1) ... [2024-10-11 04:10:51,828 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6336a4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:51, skipping insertion in model container [2024-10-11 04:10:51,828 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:10:51" (1/1) ... [2024-10-11 04:10:52,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 04:10:53,740 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c[377069,377082] [2024-10-11 04:10:53,769 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c[383339,383352] [2024-10-11 04:10:53,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:10:53,925 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 04:10:54,726 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c[377069,377082] [2024-10-11 04:10:54,737 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label40+token_ring.02.cil-1.c[383339,383352] [2024-10-11 04:10:54,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 04:10:54,810 INFO L204 MainTranslator]: Completed translation [2024-10-11 04:10:54,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54 WrapperNode [2024-10-11 04:10:54,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 04:10:54,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 04:10:54,812 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 04:10:54,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 04:10:54,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:54,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,413 INFO L138 Inliner]: procedures = 48, calls = 47, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 12633 [2024-10-11 04:10:55,414 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 04:10:55,415 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 04:10:55,415 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 04:10:55,415 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 04:10:55,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,519 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,589 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 04:10:55,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,749 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,886 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:55,994 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:56,076 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 04:10:56,078 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 04:10:56,078 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 04:10:56,079 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 04:10:56,080 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (1/1) ... [2024-10-11 04:10:56,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 04:10:56,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:10:56,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 04:10:56,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 04:10:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 04:10:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-10-11 04:10:56,170 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-10-11 04:10:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-10-11 04:10:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-10-11 04:10:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-10-11 04:10:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-10-11 04:10:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-10-11 04:10:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-10-11 04:10:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-10-11 04:10:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-10-11 04:10:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 04:10:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-10-11 04:10:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-10-11 04:10:56,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 04:10:56,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 04:10:56,336 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 04:10:56,339 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 04:11:04,015 INFO L? ?]: Removed 1695 outVars from TransFormulas that were not future-live. [2024-10-11 04:11:04,015 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 04:11:04,113 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 04:11:04,114 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-11 04:11:04,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:11:04 BoogieIcfgContainer [2024-10-11 04:11:04,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 04:11:04,117 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 04:11:04,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 04:11:04,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 04:11:04,125 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:10:51" (1/3) ... [2024-10-11 04:11:04,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5badbb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:11:04, skipping insertion in model container [2024-10-11 04:11:04,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:10:54" (2/3) ... [2024-10-11 04:11:04,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5badbb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:11:04, skipping insertion in model container [2024-10-11 04:11:04,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:11:04" (3/3) ... [2024-10-11 04:11:04,132 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label40+token_ring.02.cil-1.c [2024-10-11 04:11:04,158 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 04:11:04,159 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-11 04:11:04,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 04:11:04,299 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;@7ed52779, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 04:11:04,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-11 04:11:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 04:11:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:11:04,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:04,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:04,329 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:04,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -584044612, now seen corresponding path program 1 times [2024-10-11 04:11:04,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:04,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558230503] [2024-10-11 04:11:04,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:04,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:04,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:04,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:04,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:04,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:05,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:05,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:05,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:11:05,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:05,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558230503] [2024-10-11 04:11:05,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558230503] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:05,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:11:05,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:11:05,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757201876] [2024-10-11 04:11:05,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:05,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:11:05,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:11:05,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:11:05,077 INFO L87 Difference]: Start difference. First operand has 2241 states, 2216 states have (on average 1.8858303249097472) internal successors, (4179), 2219 states have internal predecessors, (4179), 16 states have call successors, (16), 6 states have call predecessors, (16), 6 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:06,099 INFO L93 Difference]: Finished difference Result 4643 states and 8686 transitions. [2024-10-11 04:11:06,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:11:06,103 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:11:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:06,134 INFO L225 Difference]: With dead ends: 4643 [2024-10-11 04:11:06,134 INFO L226 Difference]: Without dead ends: 2404 [2024-10-11 04:11:06,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-11 04:11:06,147 INFO L432 NwaCegarLoop]: 4057 mSDtfsCounter, 4350 mSDsluCounter, 12142 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4359 SdHoareTripleChecker+Valid, 16199 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:06,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4359 Valid, 16199 Invalid, 691 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [68 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:11:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-10-11 04:11:06,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 2345. [2024-10-11 04:11:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 2303 states have (on average 1.84020842379505) internal successors, (4238), 2306 states have internal predecessors, (4238), 27 states have call successors, (27), 12 states have call predecessors, (27), 13 states have return successors, (30), 27 states have call predecessors, (30), 27 states have call successors, (30) [2024-10-11 04:11:06,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 4295 transitions. [2024-10-11 04:11:06,301 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 4295 transitions. Word has length 61 [2024-10-11 04:11:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:06,302 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 4295 transitions. [2024-10-11 04:11:06,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 4295 transitions. [2024-10-11 04:11:06,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:11:06,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:06,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:06,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 04:11:06,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:06,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1424404092, now seen corresponding path program 1 times [2024-10-11 04:11:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:06,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138887417] [2024-10-11 04:11:06,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:06,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:06,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:06,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:06,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:06,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:11:06,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:06,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138887417] [2024-10-11 04:11:06,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138887417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:06,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:11:06,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:11:06,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929965332] [2024-10-11 04:11:06,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:06,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:11:06,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:06,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:11:06,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:06,551 INFO L87 Difference]: Start difference. First operand 2345 states and 4295 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:07,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:07,776 INFO L93 Difference]: Finished difference Result 2757 states and 4924 transitions. [2024-10-11 04:11:07,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:11:07,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:11:07,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:07,791 INFO L225 Difference]: With dead ends: 2757 [2024-10-11 04:11:07,792 INFO L226 Difference]: Without dead ends: 2541 [2024-10-11 04:11:07,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:11:07,796 INFO L432 NwaCegarLoop]: 4121 mSDtfsCounter, 4342 mSDsluCounter, 16314 mSDsCounter, 0 mSdLazyCounter, 1007 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4351 SdHoareTripleChecker+Valid, 20435 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:07,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4351 Valid, 20435 Invalid, 1048 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [41 Valid, 1007 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:11:07,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2024-10-11 04:11:07,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2446. [2024-10-11 04:11:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2446 states, 2386 states have (on average 1.8281642917015926) internal successors, (4362), 2390 states have internal predecessors, (4362), 38 states have call successors, (38), 18 states have call predecessors, (38), 20 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2024-10-11 04:11:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2446 states to 2446 states and 4443 transitions. [2024-10-11 04:11:07,894 INFO L78 Accepts]: Start accepts. Automaton has 2446 states and 4443 transitions. Word has length 61 [2024-10-11 04:11:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:07,895 INFO L471 AbstractCegarLoop]: Abstraction has 2446 states and 4443 transitions. [2024-10-11 04:11:07,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2446 states and 4443 transitions. [2024-10-11 04:11:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:11:07,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:07,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:07,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 04:11:07,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:07,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:07,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1408885374, now seen corresponding path program 1 times [2024-10-11 04:11:07,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:07,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123064131] [2024-10-11 04:11:07,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:07,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:07,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:08,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:08,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:08,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:08,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:08,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:08,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:11:08,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:08,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123064131] [2024-10-11 04:11:08,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123064131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:08,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:11:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:11:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6652302] [2024-10-11 04:11:08,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:08,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:11:08,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:08,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:11:08,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:08,099 INFO L87 Difference]: Start difference. First operand 2446 states and 4443 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:09,179 INFO L93 Difference]: Finished difference Result 3115 states and 5460 transitions. [2024-10-11 04:11:09,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 04:11:09,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:11:09,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:09,193 INFO L225 Difference]: With dead ends: 3115 [2024-10-11 04:11:09,194 INFO L226 Difference]: Without dead ends: 2798 [2024-10-11 04:11:09,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-10-11 04:11:09,198 INFO L432 NwaCegarLoop]: 4062 mSDtfsCounter, 4378 mSDsluCounter, 16167 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4387 SdHoareTripleChecker+Valid, 20229 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:09,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4387 Valid, 20229 Invalid, 887 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [59 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 04:11:09,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2798 states. [2024-10-11 04:11:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2798 to 2649. [2024-10-11 04:11:09,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2649 states, 2553 states have (on average 1.8061104582843712) internal successors, (4611), 2559 states have internal predecessors, (4611), 60 states have call successors, (60), 30 states have call predecessors, (60), 34 states have return successors, (73), 63 states have call predecessors, (73), 60 states have call successors, (73) [2024-10-11 04:11:09,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2649 states to 2649 states and 4744 transitions. [2024-10-11 04:11:09,315 INFO L78 Accepts]: Start accepts. Automaton has 2649 states and 4744 transitions. Word has length 61 [2024-10-11 04:11:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:09,315 INFO L471 AbstractCegarLoop]: Abstraction has 2649 states and 4744 transitions. [2024-10-11 04:11:09,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2649 states and 4744 transitions. [2024-10-11 04:11:09,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:11:09,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:09,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:09,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 04:11:09,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:09,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:09,320 INFO L85 PathProgramCache]: Analyzing trace with hash -946919876, now seen corresponding path program 1 times [2024-10-11 04:11:09,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:09,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341134934] [2024-10-11 04:11:09,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:09,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:09,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:09,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:09,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:09,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:09,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:09,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:11:09,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341134934] [2024-10-11 04:11:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341134934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:09,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:11:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:11:09,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278580005] [2024-10-11 04:11:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:11:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:11:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:09,492 INFO L87 Difference]: Start difference. First operand 2649 states and 4744 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:10,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:10,672 INFO L93 Difference]: Finished difference Result 3887 states and 6619 transitions. [2024-10-11 04:11:10,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:11:10,673 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:11:10,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:10,690 INFO L225 Difference]: With dead ends: 3887 [2024-10-11 04:11:10,690 INFO L226 Difference]: Without dead ends: 3367 [2024-10-11 04:11:10,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:11:10,694 INFO L432 NwaCegarLoop]: 4116 mSDtfsCounter, 4350 mSDsluCounter, 16306 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4358 SdHoareTripleChecker+Valid, 20422 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:10,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4358 Valid, 20422 Invalid, 1128 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 04:11:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3367 states. [2024-10-11 04:11:10,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3367 to 3033. [2024-10-11 04:11:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3033 states, 2869 states have (on average 1.7716974555594285) internal successors, (5083), 2879 states have internal predecessors, (5083), 100 states have call successors, (100), 54 states have call predecessors, (100), 62 states have return successors, (135), 107 states have call predecessors, (135), 100 states have call successors, (135) [2024-10-11 04:11:10,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3033 states to 3033 states and 5318 transitions. [2024-10-11 04:11:10,810 INFO L78 Accepts]: Start accepts. Automaton has 3033 states and 5318 transitions. Word has length 61 [2024-10-11 04:11:10,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:10,810 INFO L471 AbstractCegarLoop]: Abstraction has 3033 states and 5318 transitions. [2024-10-11 04:11:10,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 3033 states and 5318 transitions. [2024-10-11 04:11:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:11:10,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:10,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:10,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 04:11:10,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:10,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:10,815 INFO L85 PathProgramCache]: Analyzing trace with hash 981352826, now seen corresponding path program 1 times [2024-10-11 04:11:10,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:10,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607878425] [2024-10-11 04:11:10,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:10,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:10,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:10,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:10,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:11:10,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:10,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607878425] [2024-10-11 04:11:10,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607878425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:10,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:11:10,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 04:11:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683177281] [2024-10-11 04:11:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:10,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 04:11:10,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:10,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 04:11:10,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:10,956 INFO L87 Difference]: Start difference. First operand 3033 states and 5318 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:11,908 INFO L93 Difference]: Finished difference Result 5185 states and 8559 transitions. [2024-10-11 04:11:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 04:11:11,909 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:11:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:11,930 INFO L225 Difference]: With dead ends: 5185 [2024-10-11 04:11:11,930 INFO L226 Difference]: Without dead ends: 4281 [2024-10-11 04:11:11,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-10-11 04:11:11,937 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4350 mSDsluCounter, 16309 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4362 SdHoareTripleChecker+Valid, 20426 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:11,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4362 Valid, 20426 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:11:11,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-10-11 04:11:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3818. [2024-10-11 04:11:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3818 states, 3522 states have (on average 1.7208972174900625) internal successors, (6061), 3540 states have internal predecessors, (6061), 176 states have call successors, (176), 102 states have call predecessors, (176), 118 states have return successors, (273), 191 states have call predecessors, (273), 176 states have call successors, (273) [2024-10-11 04:11:12,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3818 states to 3818 states and 6510 transitions. [2024-10-11 04:11:12,166 INFO L78 Accepts]: Start accepts. Automaton has 3818 states and 6510 transitions. Word has length 61 [2024-10-11 04:11:12,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:12,167 INFO L471 AbstractCegarLoop]: Abstraction has 3818 states and 6510 transitions. [2024-10-11 04:11:12,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:12,167 INFO L276 IsEmpty]: Start isEmpty. Operand 3818 states and 6510 transitions. [2024-10-11 04:11:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 04:11:12,169 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:12,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:12,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 04:11:12,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:12,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:12,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1874839164, now seen corresponding path program 1 times [2024-10-11 04:11:12,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:12,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671801060] [2024-10-11 04:11:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:12,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:12,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:12,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:12,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:12,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:12,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 04:11:12,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671801060] [2024-10-11 04:11:12,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671801060] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:12,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 04:11:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 04:11:12,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327705069] [2024-10-11 04:11:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:12,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 04:11:12,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:12,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 04:11:12,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 04:11:12,280 INFO L87 Difference]: Start difference. First operand 3818 states and 6510 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:13,169 INFO L93 Difference]: Finished difference Result 6913 states and 11211 transitions. [2024-10-11 04:11:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 04:11:13,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 61 [2024-10-11 04:11:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:13,193 INFO L225 Difference]: With dead ends: 6913 [2024-10-11 04:11:13,194 INFO L226 Difference]: Without dead ends: 5225 [2024-10-11 04:11:13,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-11 04:11:13,203 INFO L432 NwaCegarLoop]: 4142 mSDtfsCounter, 4472 mSDsluCounter, 12167 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 16309 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:13,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 16309 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 04:11:13,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5225 states. [2024-10-11 04:11:13,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5225 to 4690. [2024-10-11 04:11:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4690 states, 4236 states have (on average 1.674929178470255) internal successors, (7095), 4271 states have internal predecessors, (7095), 272 states have call successors, (272), 156 states have call predecessors, (272), 180 states have return successors, (397), 278 states have call predecessors, (397), 272 states have call successors, (397) [2024-10-11 04:11:13,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 7764 transitions. [2024-10-11 04:11:13,407 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 7764 transitions. Word has length 61 [2024-10-11 04:11:13,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:13,407 INFO L471 AbstractCegarLoop]: Abstraction has 4690 states and 7764 transitions. [2024-10-11 04:11:13,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-11 04:11:13,408 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 7764 transitions. [2024-10-11 04:11:13,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:11:13,415 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:13,415 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:13,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 04:11:13,416 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:13,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2042674346, now seen corresponding path program 1 times [2024-10-11 04:11:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:13,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19167262] [2024-10-11 04:11:13,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:13,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:11:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:11:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:11:13,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19167262] [2024-10-11 04:11:13,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19167262] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:13,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882499127] [2024-10-11 04:11:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:13,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:13,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:13,567 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:13,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 04:11:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:13,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:11:13,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 04:11:13,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:13,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882499127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:13,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:13,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:11:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314398196] [2024-10-11 04:11:13,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:13,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:13,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:13,767 INFO L87 Difference]: Start difference. First operand 4690 states and 7764 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:11:14,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:14,250 INFO L93 Difference]: Finished difference Result 9693 states and 15244 transitions. [2024-10-11 04:11:14,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:14,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 99 [2024-10-11 04:11:14,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:14,308 INFO L225 Difference]: With dead ends: 9693 [2024-10-11 04:11:14,309 INFO L226 Difference]: Without dead ends: 7133 [2024-10-11 04:11:14,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:14,332 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4092 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4092 SdHoareTripleChecker+Valid, 4254 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:14,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4092 Valid, 4254 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:14,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7133 states. [2024-10-11 04:11:14,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7133 to 7105. [2024-10-11 04:11:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7105 states, 6237 states have (on average 1.6091069424402757) internal successors, (10036), 6305 states have internal predecessors, (10036), 510 states have call successors, (510), 308 states have call predecessors, (510), 356 states have return successors, (745), 507 states have call predecessors, (745), 510 states have call successors, (745) [2024-10-11 04:11:14,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7105 states to 7105 states and 11291 transitions. [2024-10-11 04:11:14,833 INFO L78 Accepts]: Start accepts. Automaton has 7105 states and 11291 transitions. Word has length 99 [2024-10-11 04:11:14,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:14,835 INFO L471 AbstractCegarLoop]: Abstraction has 7105 states and 11291 transitions. [2024-10-11 04:11:14,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 2 states have internal predecessors, (71), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 04:11:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 7105 states and 11291 transitions. [2024-10-11 04:11:14,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-11 04:11:14,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:14,848 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:14,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 04:11:15,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:15,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:15,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:15,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1877378954, now seen corresponding path program 1 times [2024-10-11 04:11:15,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:15,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913583276] [2024-10-11 04:11:15,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:15,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:15,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:15,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:11:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 04:11:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2024-10-11 04:11:15,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:15,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913583276] [2024-10-11 04:11:15,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913583276] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:15,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760502384] [2024-10-11 04:11:15,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:15,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:15,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:15,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:15,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 04:11:15,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:15,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:11:15,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:15,305 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:11:15,305 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:15,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760502384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:15,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:15,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:15,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648146250] [2024-10-11 04:11:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:15,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:15,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:15,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:15,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:15,309 INFO L87 Difference]: Start difference. First operand 7105 states and 11291 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:11:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:15,800 INFO L93 Difference]: Finished difference Result 16767 states and 25811 transitions. [2024-10-11 04:11:15,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99 [2024-10-11 04:11:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:15,856 INFO L225 Difference]: With dead ends: 16767 [2024-10-11 04:11:15,857 INFO L226 Difference]: Without dead ends: 11793 [2024-10-11 04:11:15,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:15,879 INFO L432 NwaCegarLoop]: 4254 mSDtfsCounter, 145 mSDsluCounter, 4113 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 8367 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:15,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 8367 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11793 states. [2024-10-11 04:11:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11793 to 11793. [2024-10-11 04:11:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11793 states, 10112 states have (on average 1.5505340189873418) internal successors, (15679), 10229 states have internal predecessors, (15679), 975 states have call successors, (975), 608 states have call predecessors, (975), 704 states have return successors, (1596), 987 states have call predecessors, (1596), 975 states have call successors, (1596) [2024-10-11 04:11:16,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11793 states to 11793 states and 18250 transitions. [2024-10-11 04:11:16,384 INFO L78 Accepts]: Start accepts. Automaton has 11793 states and 18250 transitions. Word has length 99 [2024-10-11 04:11:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:16,384 INFO L471 AbstractCegarLoop]: Abstraction has 11793 states and 18250 transitions. [2024-10-11 04:11:16,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-11 04:11:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 11793 states and 18250 transitions. [2024-10-11 04:11:16,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 04:11:16,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:16,413 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:16,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 04:11:16,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:16,617 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:16,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:16,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1335572908, now seen corresponding path program 1 times [2024-10-11 04:11:16,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:16,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224327193] [2024-10-11 04:11:16,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:16,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:11:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 04:11:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 04:11:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-10-11 04:11:16,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:16,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224327193] [2024-10-11 04:11:16,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224327193] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:16,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402598095] [2024-10-11 04:11:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:16,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:16,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:16,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:16,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 04:11:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:16,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:11:16,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:16,951 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:11:16,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:16,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402598095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:16,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:16,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2024-10-11 04:11:16,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410528503] [2024-10-11 04:11:16,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:16,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:16,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:16,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:16,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:16,956 INFO L87 Difference]: Start difference. First operand 11793 states and 18250 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:11:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:18,134 INFO L93 Difference]: Finished difference Result 30733 states and 46555 transitions. [2024-10-11 04:11:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 127 [2024-10-11 04:11:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:18,234 INFO L225 Difference]: With dead ends: 30733 [2024-10-11 04:11:18,234 INFO L226 Difference]: Without dead ends: 21075 [2024-10-11 04:11:18,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:18,284 INFO L432 NwaCegarLoop]: 4117 mSDtfsCounter, 4053 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4053 SdHoareTripleChecker+Valid, 4257 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:18,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4053 Valid, 4257 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:18,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21075 states. [2024-10-11 04:11:19,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21075 to 20969. [2024-10-11 04:11:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20969 states, 17708 states have (on average 1.5070589564038852) internal successors, (26687), 17939 states have internal predecessors, (26687), 1869 states have call successors, (1869), 1198 states have call predecessors, (1869), 1390 states have return successors, (3038), 1863 states have call predecessors, (3038), 1869 states have call successors, (3038) [2024-10-11 04:11:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20969 states to 20969 states and 31594 transitions. [2024-10-11 04:11:19,577 INFO L78 Accepts]: Start accepts. Automaton has 20969 states and 31594 transitions. Word has length 127 [2024-10-11 04:11:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:19,578 INFO L471 AbstractCegarLoop]: Abstraction has 20969 states and 31594 transitions. [2024-10-11 04:11:19,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 04:11:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 20969 states and 31594 transitions. [2024-10-11 04:11:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 04:11:19,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:19,636 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:19,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 04:11:19,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:19,837 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:19,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:19,838 INFO L85 PathProgramCache]: Analyzing trace with hash 791512030, now seen corresponding path program 1 times [2024-10-11 04:11:19,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:19,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829176479] [2024-10-11 04:11:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:19,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 04:11:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:11:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:11:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 04:11:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:19,987 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:11:19,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:19,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829176479] [2024-10-11 04:11:19,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829176479] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:19,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891773439] [2024-10-11 04:11:19,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:19,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:19,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:19,991 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:19,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 04:11:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:20,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:11:20,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:20,187 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 04:11:20,189 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891773439] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562580712] [2024-10-11 04:11:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:20,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:20,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:20,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:20,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:20,192 INFO L87 Difference]: Start difference. First operand 20969 states and 31594 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:11:21,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:21,028 INFO L93 Difference]: Finished difference Result 33443 states and 50451 transitions. [2024-10-11 04:11:21,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:21,028 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 143 [2024-10-11 04:11:21,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:21,116 INFO L225 Difference]: With dead ends: 33443 [2024-10-11 04:11:21,116 INFO L226 Difference]: Without dead ends: 18715 [2024-10-11 04:11:21,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:21,168 INFO L432 NwaCegarLoop]: 4114 mSDtfsCounter, 4086 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4086 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:21,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4086 Valid, 4142 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18715 states. [2024-10-11 04:11:22,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18715 to 14099. [2024-10-11 04:11:22,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14099 states, 12046 states have (on average 1.4857214012950357) internal successors, (17897), 12167 states have internal predecessors, (17897), 1161 states have call successors, (1161), 794 states have call predecessors, (1161), 890 states have return successors, (1648), 1153 states have call predecessors, (1648), 1161 states have call successors, (1648) [2024-10-11 04:11:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14099 states to 14099 states and 20706 transitions. [2024-10-11 04:11:22,094 INFO L78 Accepts]: Start accepts. Automaton has 14099 states and 20706 transitions. Word has length 143 [2024-10-11 04:11:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:22,095 INFO L471 AbstractCegarLoop]: Abstraction has 14099 states and 20706 transitions. [2024-10-11 04:11:22,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:11:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 14099 states and 20706 transitions. [2024-10-11 04:11:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-10-11 04:11:22,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:22,122 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:22,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 04:11:22,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 04:11:22,327 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:22,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:22,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2075302660, now seen corresponding path program 1 times [2024-10-11 04:11:22,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:22,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935119176] [2024-10-11 04:11:22,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:22,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:22,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:22,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:22,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 04:11:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 04:11:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:11:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 04:11:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:11:22,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:22,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935119176] [2024-10-11 04:11:22,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935119176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:22,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277409752] [2024-10-11 04:11:22,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:22,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:22,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:22,464 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:22,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 04:11:22,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:22,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:11:22,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-10-11 04:11:22,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:22,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277409752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:22,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:22,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:22,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678614327] [2024-10-11 04:11:22,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:22,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:22,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:22,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:22,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:22,626 INFO L87 Difference]: Start difference. First operand 14099 states and 20706 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:11:23,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:23,319 INFO L93 Difference]: Finished difference Result 23244 states and 33469 transitions. [2024-10-11 04:11:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 143 [2024-10-11 04:11:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:23,388 INFO L225 Difference]: With dead ends: 23244 [2024-10-11 04:11:23,388 INFO L226 Difference]: Without dead ends: 14923 [2024-10-11 04:11:23,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:23,414 INFO L432 NwaCegarLoop]: 4144 mSDtfsCounter, 4079 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4079 SdHoareTripleChecker+Valid, 4289 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:23,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4079 Valid, 4289 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:23,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14923 states. [2024-10-11 04:11:24,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14923 to 14857. [2024-10-11 04:11:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14857 states, 12716 states have (on average 1.4599716892104435) internal successors, (18565), 12837 states have internal predecessors, (18565), 1183 states have call successors, (1183), 860 states have call predecessors, (1183), 956 states have return successors, (1736), 1175 states have call predecessors, (1736), 1183 states have call successors, (1736) [2024-10-11 04:11:24,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14857 states to 14857 states and 21484 transitions. [2024-10-11 04:11:24,217 INFO L78 Accepts]: Start accepts. Automaton has 14857 states and 21484 transitions. Word has length 143 [2024-10-11 04:11:24,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:24,217 INFO L471 AbstractCegarLoop]: Abstraction has 14857 states and 21484 transitions. [2024-10-11 04:11:24,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:11:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 14857 states and 21484 transitions. [2024-10-11 04:11:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:11:24,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:24,242 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:24,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 04:11:24,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 04:11:24,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:24,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:24,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1556193784, now seen corresponding path program 1 times [2024-10-11 04:11:24,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:24,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194181032] [2024-10-11 04:11:24,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:24,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:24,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:24,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:11:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:24,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:11:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 04:11:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:11:24,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,585 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:11:24,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:24,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194181032] [2024-10-11 04:11:24,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194181032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:24,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690443657] [2024-10-11 04:11:24,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:24,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:24,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:24,588 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:24,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 04:11:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:24,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:11:24,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-10-11 04:11:24,728 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:24,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690443657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:24,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:24,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:24,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517341479] [2024-10-11 04:11:24,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:24,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:24,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:24,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:24,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:24,731 INFO L87 Difference]: Start difference. First operand 14857 states and 21484 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:11:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:26,402 INFO L93 Difference]: Finished difference Result 39509 states and 55950 transitions. [2024-10-11 04:11:26,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:26,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-11 04:11:26,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:26,537 INFO L225 Difference]: With dead ends: 39509 [2024-10-11 04:11:26,537 INFO L226 Difference]: Without dead ends: 26789 [2024-10-11 04:11:26,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:26,588 INFO L432 NwaCegarLoop]: 4252 mSDtfsCounter, 135 mSDsluCounter, 4111 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 8363 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:26,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 8363 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26789 states. [2024-10-11 04:11:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26789 to 26743. [2024-10-11 04:11:28,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26743 states, 22644 states have (on average 1.4140169581346052) internal successors, (32019), 22885 states have internal predecessors, (32019), 2245 states have call successors, (2245), 1660 states have call predecessors, (2245), 1852 states have return successors, (3798), 2229 states have call predecessors, (3798), 2245 states have call successors, (3798) [2024-10-11 04:11:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26743 states to 26743 states and 38062 transitions. [2024-10-11 04:11:28,164 INFO L78 Accepts]: Start accepts. Automaton has 26743 states and 38062 transitions. Word has length 144 [2024-10-11 04:11:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:28,165 INFO L471 AbstractCegarLoop]: Abstraction has 26743 states and 38062 transitions. [2024-10-11 04:11:28,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:11:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 26743 states and 38062 transitions. [2024-10-11 04:11:28,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:11:28,206 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:28,206 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:28,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 04:11:28,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 04:11:28,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:28,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:28,408 INFO L85 PathProgramCache]: Analyzing trace with hash 125794537, now seen corresponding path program 1 times [2024-10-11 04:11:28,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:28,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898551666] [2024-10-11 04:11:28,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:28,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:28,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:28,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:11:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:11:28,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:11:28,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:11:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,538 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-11 04:11:28,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:28,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898551666] [2024-10-11 04:11:28,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898551666] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:28,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252765143] [2024-10-11 04:11:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:28,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:28,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:28,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:28,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 04:11:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:28,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 495 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:11:28,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-11 04:11:28,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:28,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252765143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:28,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:28,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:28,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515257967] [2024-10-11 04:11:28,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:28,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:28,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:28,753 INFO L87 Difference]: Start difference. First operand 26743 states and 38062 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:11:29,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:29,897 INFO L93 Difference]: Finished difference Result 52491 states and 75074 transitions. [2024-10-11 04:11:29,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:29,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 144 [2024-10-11 04:11:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:30,009 INFO L225 Difference]: With dead ends: 52491 [2024-10-11 04:11:30,010 INFO L226 Difference]: Without dead ends: 27885 [2024-10-11 04:11:30,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:30,084 INFO L432 NwaCegarLoop]: 4108 mSDtfsCounter, 4065 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4065 SdHoareTripleChecker+Valid, 4135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:30,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4065 Valid, 4135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27885 states. [2024-10-11 04:11:31,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27885 to 27841. [2024-10-11 04:11:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27841 states, 23682 states have (on average 1.3691833460011824) internal successors, (32425), 23923 states have internal predecessors, (32425), 2245 states have call successors, (2245), 1720 states have call predecessors, (2245), 1912 states have return successors, (3754), 2229 states have call predecessors, (3754), 2245 states have call successors, (3754) [2024-10-11 04:11:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27841 states to 27841 states and 38424 transitions. [2024-10-11 04:11:31,687 INFO L78 Accepts]: Start accepts. Automaton has 27841 states and 38424 transitions. Word has length 144 [2024-10-11 04:11:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:31,687 INFO L471 AbstractCegarLoop]: Abstraction has 27841 states and 38424 transitions. [2024-10-11 04:11:31,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-10-11 04:11:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 27841 states and 38424 transitions. [2024-10-11 04:11:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 04:11:31,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:31,724 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:31,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 04:11:31,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:31,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:31,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:31,925 INFO L85 PathProgramCache]: Analyzing trace with hash -782339540, now seen corresponding path program 1 times [2024-10-11 04:11:31,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:31,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893485560] [2024-10-11 04:11:31,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:31,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:31,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:31,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:31,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 04:11:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 04:11:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 04:11:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 04:11:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-10-11 04:11:32,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:32,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893485560] [2024-10-11 04:11:32,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893485560] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112292947] [2024-10-11 04:11:32,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:32,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:32,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:32,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:32,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 04:11:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:32,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 04:11:32,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:32,176 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 04:11:32,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:32,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112292947] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:32,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:32,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:32,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039725143] [2024-10-11 04:11:32,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:32,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:32,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:32,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:32,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:32,178 INFO L87 Difference]: Start difference. First operand 27841 states and 38424 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:11:35,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:35,133 INFO L93 Difference]: Finished difference Result 75539 states and 103548 transitions. [2024-10-11 04:11:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:35,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 144 [2024-10-11 04:11:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:35,446 INFO L225 Difference]: With dead ends: 75539 [2024-10-11 04:11:35,446 INFO L226 Difference]: Without dead ends: 49843 [2024-10-11 04:11:35,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:35,491 INFO L432 NwaCegarLoop]: 4247 mSDtfsCounter, 139 mSDsluCounter, 4107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 8354 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:35,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 8354 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:35,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49843 states. [2024-10-11 04:11:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49843 to 49841. [2024-10-11 04:11:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49841 states, 41974 states have (on average 1.333468337542288) internal successors, (55971), 42455 states have internal predecessors, (55971), 4265 states have call successors, (4265), 3216 states have call predecessors, (4265), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2024-10-11 04:11:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49841 states to 49841 states and 68436 transitions. [2024-10-11 04:11:38,693 INFO L78 Accepts]: Start accepts. Automaton has 49841 states and 68436 transitions. Word has length 144 [2024-10-11 04:11:38,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:38,693 INFO L471 AbstractCegarLoop]: Abstraction has 49841 states and 68436 transitions. [2024-10-11 04:11:38,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2024-10-11 04:11:38,694 INFO L276 IsEmpty]: Start isEmpty. Operand 49841 states and 68436 transitions. [2024-10-11 04:11:38,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 04:11:38,750 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:38,750 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:38,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 04:11:38,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 04:11:38,951 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:38,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:38,951 INFO L85 PathProgramCache]: Analyzing trace with hash -873894743, now seen corresponding path program 1 times [2024-10-11 04:11:38,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:38,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999603281] [2024-10-11 04:11:38,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:38,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:38,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:39,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:39,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:11:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:11:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 04:11:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 04:11:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,099 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-10-11 04:11:39,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999603281] [2024-10-11 04:11:39,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999603281] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:39,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742822836] [2024-10-11 04:11:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:39,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:39,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:39,102 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:39,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 04:11:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:39,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:11:39,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-10-11 04:11:39,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:39,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742822836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:39,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440731333] [2024-10-11 04:11:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:39,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:39,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:39,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:39,405 INFO L87 Difference]: Start difference. First operand 49841 states and 68436 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:11:42,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 04:11:42,292 INFO L93 Difference]: Finished difference Result 87149 states and 119166 transitions. [2024-10-11 04:11:42,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 04:11:42,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 145 [2024-10-11 04:11:42,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 04:11:42,497 INFO L225 Difference]: With dead ends: 87149 [2024-10-11 04:11:42,497 INFO L226 Difference]: Without dead ends: 51011 [2024-10-11 04:11:42,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:42,583 INFO L432 NwaCegarLoop]: 4134 mSDtfsCounter, 4085 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4085 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 04:11:42,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4085 Valid, 4275 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 04:11:42,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51011 states. [2024-10-11 04:11:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51011 to 49721. [2024-10-11 04:11:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49721 states, 41854 states have (on average 1.324389544607445) internal successors, (55431), 42335 states have internal predecessors, (55431), 4265 states have call successors, (4265), 3216 states have call predecessors, (4265), 3600 states have return successors, (8200), 4233 states have call predecessors, (8200), 4265 states have call successors, (8200) [2024-10-11 04:11:45,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49721 states to 49721 states and 67896 transitions. [2024-10-11 04:11:45,989 INFO L78 Accepts]: Start accepts. Automaton has 49721 states and 67896 transitions. Word has length 145 [2024-10-11 04:11:45,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 04:11:45,990 INFO L471 AbstractCegarLoop]: Abstraction has 49721 states and 67896 transitions. [2024-10-11 04:11:45,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-10-11 04:11:45,990 INFO L276 IsEmpty]: Start isEmpty. Operand 49721 states and 67896 transitions. [2024-10-11 04:11:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-11 04:11:46,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 04:11:46,038 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 04:11:46,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 04:11:46,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:46,239 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 04:11:46,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 04:11:46,239 INFO L85 PathProgramCache]: Analyzing trace with hash 133090187, now seen corresponding path program 1 times [2024-10-11 04:11:46,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 04:11:46,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198871159] [2024-10-11 04:11:46,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:46,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 04:11:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 04:11:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-11 04:11:46,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 04:11:46,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 04:11:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 04:11:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 04:11:46,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 04:11:46,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:46,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 04:11:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-11 04:11:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 04:11:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,362 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-11 04:11:46,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 04:11:46,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198871159] [2024-10-11 04:11:46,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198871159] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 04:11:46,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850157430] [2024-10-11 04:11:46,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 04:11:46,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 04:11:46,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 04:11:46,366 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 04:11:46,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 04:11:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 04:11:46,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 04:11:46,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 04:11:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-10-11 04:11:46,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 04:11:46,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850157430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 04:11:46,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 04:11:46,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-10-11 04:11:46,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323203267] [2024-10-11 04:11:46,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 04:11:46,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 04:11:46,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 04:11:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 04:11:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 04:11:46,526 INFO L87 Difference]: Start difference. First operand 49721 states and 67896 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9)