./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 22:24:06,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 22:24:06,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 22:24:06,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 22:24:06,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 22:24:06,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 22:24:06,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 22:24:06,938 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 22:24:06,947 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 22:24:06,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 22:24:06,949 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 22:24:06,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 22:24:06,951 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 22:24:06,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 22:24:06,953 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 22:24:06,953 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 22:24:06,953 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 22:24:06,954 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 22:24:06,954 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 22:24:06,954 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 22:24:06,954 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 22:24:06,957 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 22:24:06,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 22:24:06,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 22:24:06,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 22:24:06,958 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 22:24:06,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 22:24:06,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 22:24:06,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 22:24:06,960 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 22:24:06,960 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 22:24:06,960 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 22:24:06,961 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:24:06,961 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 22:24:06,962 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 22:24:06,962 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 22:24:06,962 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 22:24:06,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 22:24:06,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 22:24:06,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 22:24:06,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 22:24:06,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 22:24:06,964 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2024-11-19 22:24:07,220 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 22:24:07,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 22:24:07,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 22:24:07,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 22:24:07,249 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 22:24:07,250 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-19 22:24:08,655 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 22:24:08,893 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 22:24:08,894 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-19 22:24:08,905 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c8971a9/719e43159db142f08288af7d2a1698e4/FLAG4da015479 [2024-11-19 22:24:08,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c8971a9/719e43159db142f08288af7d2a1698e4 [2024-11-19 22:24:08,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 22:24:08,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 22:24:08,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 22:24:08,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 22:24:08,929 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 22:24:08,930 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:24:08" (1/1) ... [2024-11-19 22:24:08,931 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e20fcf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:08, skipping insertion in model container [2024-11-19 22:24:08,931 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:24:08" (1/1) ... [2024-11-19 22:24:08,968 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 22:24:09,240 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-11-19 22:24:09,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:24:09,253 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 22:24:09,308 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2024-11-19 22:24:09,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 22:24:09,336 INFO L204 MainTranslator]: Completed translation [2024-11-19 22:24:09,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09 WrapperNode [2024-11-19 22:24:09,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 22:24:09,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 22:24:09,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 22:24:09,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 22:24:09,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,397 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 419 [2024-11-19 22:24:09,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 22:24:09,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 22:24:09,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 22:24:09,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 22:24:09,411 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,448 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-19 22:24:09,448 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,449 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,481 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,484 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 22:24:09,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 22:24:09,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 22:24:09,496 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 22:24:09,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (1/1) ... [2024-11-19 22:24:09,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 22:24:09,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:09,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 22:24:09,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 22:24:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 22:24:09,603 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2024-11-19 22:24:09,604 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2024-11-19 22:24:09,604 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2024-11-19 22:24:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2024-11-19 22:24:09,605 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2024-11-19 22:24:09,605 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2024-11-19 22:24:09,606 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2024-11-19 22:24:09,606 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2024-11-19 22:24:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2024-11-19 22:24:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2024-11-19 22:24:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 22:24:09,607 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 22:24:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 22:24:09,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 22:24:09,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 22:24:09,710 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 22:24:09,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 22:24:10,265 INFO L? ?]: Removed 102 outVars from TransFormulas that were not future-live. [2024-11-19 22:24:10,266 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 22:24:10,286 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 22:24:10,288 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 22:24:10,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:24:10 BoogieIcfgContainer [2024-11-19 22:24:10,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 22:24:10,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 22:24:10,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 22:24:10,296 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 22:24:10,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:24:08" (1/3) ... [2024-11-19 22:24:10,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e47fb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:24:10, skipping insertion in model container [2024-11-19 22:24:10,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:24:09" (2/3) ... [2024-11-19 22:24:10,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e47fb89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:24:10, skipping insertion in model container [2024-11-19 22:24:10,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:24:10" (3/3) ... [2024-11-19 22:24:10,299 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2024-11-19 22:24:10,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 22:24:10,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 22:24:10,389 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 22:24:10,394 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;@707b63af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 22:24:10,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 22:24:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 22:24:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 22:24:10,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:10,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:10,410 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:10,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -2086312570, now seen corresponding path program 1 times [2024-11-19 22:24:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:10,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964339630] [2024-11-19 22:24:10,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:10,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:10,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964339630] [2024-11-19 22:24:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964339630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:10,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:10,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:10,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146846515] [2024-11-19 22:24:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:10,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:10,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:10,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:10,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:10,829 INFO L87 Difference]: Start difference. First operand has 178 states, 133 states have (on average 1.586466165413534) internal successors, (211), 138 states have internal predecessors, (211), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:24:11,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:11,014 INFO L93 Difference]: Finished difference Result 355 states and 608 transitions. [2024-11-19 22:24:11,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:11,017 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-19 22:24:11,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:11,029 INFO L225 Difference]: With dead ends: 355 [2024-11-19 22:24:11,031 INFO L226 Difference]: Without dead ends: 180 [2024-11-19 22:24:11,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:11,040 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 7 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:11,040 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 803 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:11,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-19 22:24:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2024-11-19 22:24:11,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 135 states have (on average 1.5555555555555556) internal successors, (210), 139 states have internal predecessors, (210), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-19 22:24:11,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 284 transitions. [2024-11-19 22:24:11,121 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 284 transitions. Word has length 15 [2024-11-19 22:24:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:11,123 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 284 transitions. [2024-11-19 22:24:11,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:24:11,127 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 284 transitions. [2024-11-19 22:24:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 22:24:11,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:11,131 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:11,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 22:24:11,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:11,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:11,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2089918424, now seen corresponding path program 1 times [2024-11-19 22:24:11,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:11,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113546597] [2024-11-19 22:24:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:11,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:11,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113546597] [2024-11-19 22:24:11,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113546597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:11,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:11,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:11,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999284438] [2024-11-19 22:24:11,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:11,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:11,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:11,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:11,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:11,287 INFO L87 Difference]: Start difference. First operand 180 states and 284 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:24:11,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:11,368 INFO L93 Difference]: Finished difference Result 373 states and 591 transitions. [2024-11-19 22:24:11,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:11,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-19 22:24:11,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:11,373 INFO L225 Difference]: With dead ends: 373 [2024-11-19 22:24:11,373 INFO L226 Difference]: Without dead ends: 196 [2024-11-19 22:24:11,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:11,380 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:11,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 819 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:11,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-19 22:24:11,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2024-11-19 22:24:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 22:24:11,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2024-11-19 22:24:11,403 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 16 [2024-11-19 22:24:11,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:11,403 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2024-11-19 22:24:11,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 22:24:11,404 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2024-11-19 22:24:11,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 22:24:11,405 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:11,405 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:11,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 22:24:11,406 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:11,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:11,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2079657108, now seen corresponding path program 1 times [2024-11-19 22:24:11,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:11,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901012513] [2024-11-19 22:24:11,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:11,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901012513] [2024-11-19 22:24:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901012513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:11,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:11,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 22:24:11,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467369786] [2024-11-19 22:24:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 22:24:11,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:11,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 22:24:11,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:24:11,536 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:24:11,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:11,567 INFO L93 Difference]: Finished difference Result 405 states and 637 transitions. [2024-11-19 22:24:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 22:24:11,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2024-11-19 22:24:11,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:11,573 INFO L225 Difference]: With dead ends: 405 [2024-11-19 22:24:11,573 INFO L226 Difference]: Without dead ends: 222 [2024-11-19 22:24:11,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 22:24:11,576 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 22 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:11,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 550 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:11,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-19 22:24:11,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 195. [2024-11-19 22:24:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.527027027027027) internal successors, (226), 152 states have internal predecessors, (226), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 22:24:11,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 302 transitions. [2024-11-19 22:24:11,606 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 302 transitions. Word has length 24 [2024-11-19 22:24:11,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:11,606 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 302 transitions. [2024-11-19 22:24:11,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 22:24:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 302 transitions. [2024-11-19 22:24:11,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 22:24:11,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:11,608 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 22:24:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 22:24:11,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1546063421, now seen corresponding path program 1 times [2024-11-19 22:24:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179950895] [2024-11-19 22:24:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:11,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:11,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:11,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179950895] [2024-11-19 22:24:11,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179950895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:11,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:11,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:24:11,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919827697] [2024-11-19 22:24:11,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:11,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:24:11,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:11,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:24:11,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:11,755 INFO L87 Difference]: Start difference. First operand 195 states and 302 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:24:11,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:11,804 INFO L93 Difference]: Finished difference Result 380 states and 593 transitions. [2024-11-19 22:24:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:11,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2024-11-19 22:24:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:11,809 INFO L225 Difference]: With dead ends: 380 [2024-11-19 22:24:11,809 INFO L226 Difference]: Without dead ends: 201 [2024-11-19 22:24:11,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:11,814 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 0 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:11,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1094 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-11-19 22:24:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2024-11-19 22:24:11,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 155 states have internal predecessors, (229), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2024-11-19 22:24:11,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 306 transitions. [2024-11-19 22:24:11,836 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 306 transitions. Word has length 32 [2024-11-19 22:24:11,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:11,836 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 306 transitions. [2024-11-19 22:24:11,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:24:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 306 transitions. [2024-11-19 22:24:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 22:24:11,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:11,841 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] [2024-11-19 22:24:11,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 22:24:11,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:11,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:11,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1069273240, now seen corresponding path program 1 times [2024-11-19 22:24:11,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:11,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242080918] [2024-11-19 22:24:11,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:11,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-19 22:24:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:11,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:11,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:11,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242080918] [2024-11-19 22:24:11,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242080918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:11,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:11,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:24:11,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795961664] [2024-11-19 22:24:11,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:11,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:24:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:11,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:24:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:24:11,991 INFO L87 Difference]: Start difference. First operand 199 states and 306 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:24:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:12,070 INFO L93 Difference]: Finished difference Result 343 states and 534 transitions. [2024-11-19 22:24:12,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:24:12,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2024-11-19 22:24:12,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:12,072 INFO L225 Difference]: With dead ends: 343 [2024-11-19 22:24:12,072 INFO L226 Difference]: Without dead ends: 195 [2024-11-19 22:24:12,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:24:12,074 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 0 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:12,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1330 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:24:12,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2024-11-19 22:24:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2024-11-19 22:24:12,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.4932432432432432) internal successors, (221), 152 states have internal predecessors, (221), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-19 22:24:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 297 transitions. [2024-11-19 22:24:12,093 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 297 transitions. Word has length 35 [2024-11-19 22:24:12,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:12,094 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 297 transitions. [2024-11-19 22:24:12,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 22:24:12,094 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 297 transitions. [2024-11-19 22:24:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-19 22:24:12,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:12,096 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 22:24:12,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 22:24:12,097 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:12,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:12,097 INFO L85 PathProgramCache]: Analyzing trace with hash -32659331, now seen corresponding path program 1 times [2024-11-19 22:24:12,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:12,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388271007] [2024-11-19 22:24:12,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:12,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:12,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:12,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:12,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388271007] [2024-11-19 22:24:12,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388271007] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:12,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434877255] [2024-11-19 22:24:12,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:12,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:12,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:12,195 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:12,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 22:24:12,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,301 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 22:24:12,306 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:12,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:24:12,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 22:24:12,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434877255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:24:12,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:24:12,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-19 22:24:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15231392] [2024-11-19 22:24:12,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:24:12,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:24:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:12,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:24:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:12,388 INFO L87 Difference]: Start difference. First operand 195 states and 297 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 22:24:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:12,435 INFO L93 Difference]: Finished difference Result 438 states and 681 transitions. [2024-11-19 22:24:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2024-11-19 22:24:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:12,441 INFO L225 Difference]: With dead ends: 438 [2024-11-19 22:24:12,441 INFO L226 Difference]: Without dead ends: 254 [2024-11-19 22:24:12,442 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:12,443 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 58 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:12,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1052 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:12,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-19 22:24:12,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 248. [2024-11-19 22:24:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 191 states have (on average 1.4659685863874345) internal successors, (280), 195 states have internal predecessors, (280), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-19 22:24:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 376 transitions. [2024-11-19 22:24:12,464 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 376 transitions. Word has length 35 [2024-11-19 22:24:12,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:12,464 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 376 transitions. [2024-11-19 22:24:12,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 22:24:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 376 transitions. [2024-11-19 22:24:12,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 22:24:12,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:12,469 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:12,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 22:24:12,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 22:24:12,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:12,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1003259933, now seen corresponding path program 2 times [2024-11-19 22:24:12,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:12,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530187729] [2024-11-19 22:24:12,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:12,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,776 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-19 22:24:12,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:12,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530187729] [2024-11-19 22:24:12,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530187729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:12,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:12,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:12,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23919997] [2024-11-19 22:24:12,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:12,781 INFO L87 Difference]: Start difference. First operand 248 states and 376 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:24:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:12,831 INFO L93 Difference]: Finished difference Result 506 states and 778 transitions. [2024-11-19 22:24:12,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:12,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-19 22:24:12,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:12,835 INFO L225 Difference]: With dead ends: 506 [2024-11-19 22:24:12,835 INFO L226 Difference]: Without dead ends: 287 [2024-11-19 22:24:12,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:12,838 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 24 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:12,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 811 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:12,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2024-11-19 22:24:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2024-11-19 22:24:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 223 states have (on average 1.4215246636771302) internal successors, (317), 227 states have internal predecessors, (317), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 22:24:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 419 transitions. [2024-11-19 22:24:12,876 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 419 transitions. Word has length 57 [2024-11-19 22:24:12,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:12,877 INFO L471 AbstractCegarLoop]: Abstraction has 284 states and 419 transitions. [2024-11-19 22:24:12,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:24:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 419 transitions. [2024-11-19 22:24:12,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 22:24:12,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:12,879 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:12,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 22:24:12,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:12,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:12,880 INFO L85 PathProgramCache]: Analyzing trace with hash -447415154, now seen corresponding path program 1 times [2024-11-19 22:24:12,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:12,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532516112] [2024-11-19 22:24:12,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:12,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:12,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:12,991 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-19 22:24:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532516112] [2024-11-19 22:24:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532516112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734595913] [2024-11-19 22:24:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:12,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:12,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:12,994 INFO L87 Difference]: Start difference. First operand 284 states and 419 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:24:13,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:13,052 INFO L93 Difference]: Finished difference Result 541 states and 819 transitions. [2024-11-19 22:24:13,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:13,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2024-11-19 22:24:13,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:13,056 INFO L225 Difference]: With dead ends: 541 [2024-11-19 22:24:13,057 INFO L226 Difference]: Without dead ends: 291 [2024-11-19 22:24:13,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:13,061 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 8 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 793 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:13,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 793 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2024-11-19 22:24:13,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2024-11-19 22:24:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4192139737991267) internal successors, (325), 233 states have internal predecessors, (325), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 22:24:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 427 transitions. [2024-11-19 22:24:13,083 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 427 transitions. Word has length 57 [2024-11-19 22:24:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:13,084 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 427 transitions. [2024-11-19 22:24:13,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 22:24:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 427 transitions. [2024-11-19 22:24:13,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-19 22:24:13,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:13,087 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 22:24:13,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 22:24:13,087 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:13,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:13,088 INFO L85 PathProgramCache]: Analyzing trace with hash 879511853, now seen corresponding path program 1 times [2024-11-19 22:24:13,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:13,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253825997] [2024-11-19 22:24:13,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:13,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:13,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:13,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:13,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-19 22:24:13,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253825997] [2024-11-19 22:24:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253825997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:13,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:13,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:24:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418514374] [2024-11-19 22:24:13,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:13,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:24:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:13,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:24:13,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:13,237 INFO L87 Difference]: Start difference. First operand 291 states and 427 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:24:13,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:13,270 INFO L93 Difference]: Finished difference Result 531 states and 793 transitions. [2024-11-19 22:24:13,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:13,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2024-11-19 22:24:13,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:13,273 INFO L225 Difference]: With dead ends: 531 [2024-11-19 22:24:13,274 INFO L226 Difference]: Without dead ends: 293 [2024-11-19 22:24:13,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:13,276 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:13,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1081 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:13,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-19 22:24:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2024-11-19 22:24:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.4061135371179039) internal successors, (322), 233 states have internal predecessors, (322), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-19 22:24:13,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 424 transitions. [2024-11-19 22:24:13,294 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 424 transitions. Word has length 75 [2024-11-19 22:24:13,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:13,294 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 424 transitions. [2024-11-19 22:24:13,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:24:13,295 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 424 transitions. [2024-11-19 22:24:13,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-19 22:24:13,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:13,296 INFO L215 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:13,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 22:24:13,296 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:13,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1733898963, now seen corresponding path program 1 times [2024-11-19 22:24:13,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:13,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352559682] [2024-11-19 22:24:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:13,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:13,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:13,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:13,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-11-19 22:24:13,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:13,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352559682] [2024-11-19 22:24:13,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352559682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:13,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:13,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:13,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737049937] [2024-11-19 22:24:13,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:13,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:13,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:13,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:13,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:13,442 INFO L87 Difference]: Start difference. First operand 291 states and 424 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:24:13,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:13,501 INFO L93 Difference]: Finished difference Result 568 states and 849 transitions. [2024-11-19 22:24:13,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:13,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-19 22:24:13,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:13,505 INFO L225 Difference]: With dead ends: 568 [2024-11-19 22:24:13,505 INFO L226 Difference]: Without dead ends: 335 [2024-11-19 22:24:13,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:13,506 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 25 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:13,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 811 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:13,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-19 22:24:13,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2024-11-19 22:24:13,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 266 states have (on average 1.368421052631579) internal successors, (364), 270 states have internal predecessors, (364), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-19 22:24:13,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 472 transitions. [2024-11-19 22:24:13,550 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 472 transitions. Word has length 104 [2024-11-19 22:24:13,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:13,550 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 472 transitions. [2024-11-19 22:24:13,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:24:13,551 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 472 transitions. [2024-11-19 22:24:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-19 22:24:13,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:13,552 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:13,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 22:24:13,552 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:13,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash -8134044, now seen corresponding path program 1 times [2024-11-19 22:24:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:13,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878603616] [2024-11-19 22:24:13,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:13,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:13,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:13,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-19 22:24:13,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:13,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878603616] [2024-11-19 22:24:13,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878603616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:13,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:13,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:13,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067653236] [2024-11-19 22:24:13,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:13,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:13,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:13,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:13,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:13,650 INFO L87 Difference]: Start difference. First operand 332 states and 472 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:24:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:13,700 INFO L93 Difference]: Finished difference Result 594 states and 869 transitions. [2024-11-19 22:24:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2024-11-19 22:24:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:13,703 INFO L225 Difference]: With dead ends: 594 [2024-11-19 22:24:13,703 INFO L226 Difference]: Without dead ends: 326 [2024-11-19 22:24:13,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:13,706 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 9 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:13,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 776 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-19 22:24:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-19 22:24:13,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3486590038314177) internal successors, (352), 265 states have internal predecessors, (352), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-19 22:24:13,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 458 transitions. [2024-11-19 22:24:13,722 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 458 transitions. Word has length 105 [2024-11-19 22:24:13,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:13,722 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 458 transitions. [2024-11-19 22:24:13,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 22:24:13,723 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 458 transitions. [2024-11-19 22:24:13,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 22:24:13,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:13,724 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 22:24:13,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 22:24:13,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:13,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:13,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1589641163, now seen corresponding path program 1 times [2024-11-19 22:24:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247622890] [2024-11-19 22:24:13,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:13,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:13,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:13,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:13,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:13,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:13,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:13,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:13,868 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2024-11-19 22:24:13,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:13,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247622890] [2024-11-19 22:24:13,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247622890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:13,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:13,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:24:13,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719949630] [2024-11-19 22:24:13,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:13,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:24:13,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:13,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:24:13,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:13,870 INFO L87 Difference]: Start difference. First operand 326 states and 458 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 22:24:13,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:13,901 INFO L93 Difference]: Finished difference Result 569 states and 818 transitions. [2024-11-19 22:24:13,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:13,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2024-11-19 22:24:13,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:13,904 INFO L225 Difference]: With dead ends: 569 [2024-11-19 22:24:13,904 INFO L226 Difference]: Without dead ends: 328 [2024-11-19 22:24:13,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:13,906 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:13,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1065 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-19 22:24:13,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2024-11-19 22:24:13,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 261 states have (on average 1.3371647509578544) internal successors, (349), 265 states have internal predecessors, (349), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-19 22:24:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 455 transitions. [2024-11-19 22:24:13,924 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 455 transitions. Word has length 124 [2024-11-19 22:24:13,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:13,924 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 455 transitions. [2024-11-19 22:24:13,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 22:24:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 455 transitions. [2024-11-19 22:24:13,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-19 22:24:13,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:13,928 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:13,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 22:24:13,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:13,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:13,928 INFO L85 PathProgramCache]: Analyzing trace with hash -164352821, now seen corresponding path program 1 times [2024-11-19 22:24:13,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:13,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739107077] [2024-11-19 22:24:13,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:13,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,097 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-19 22:24:14,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:14,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739107077] [2024-11-19 22:24:14,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739107077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:14,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:14,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:14,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506525734] [2024-11-19 22:24:14,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:14,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:14,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:14,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:14,099 INFO L87 Difference]: Start difference. First operand 326 states and 455 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 22:24:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:14,151 INFO L93 Difference]: Finished difference Result 532 states and 778 transitions. [2024-11-19 22:24:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:14,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2024-11-19 22:24:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:14,154 INFO L225 Difference]: With dead ends: 532 [2024-11-19 22:24:14,154 INFO L226 Difference]: Without dead ends: 324 [2024-11-19 22:24:14,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:14,156 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 7 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:14,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 744 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-19 22:24:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2024-11-19 22:24:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 260 states have (on average 1.3346153846153845) internal successors, (347), 264 states have internal predecessors, (347), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 22:24:14,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 451 transitions. [2024-11-19 22:24:14,169 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 451 transitions. Word has length 157 [2024-11-19 22:24:14,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:14,170 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 451 transitions. [2024-11-19 22:24:14,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-19 22:24:14,170 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 451 transitions. [2024-11-19 22:24:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-19 22:24:14,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:14,172 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:14,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 22:24:14,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:14,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:14,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1524827283, now seen corresponding path program 1 times [2024-11-19 22:24:14,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:14,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214090398] [2024-11-19 22:24:14,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:14,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:14,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:14,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-19 22:24:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-19 22:24:14,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:14,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214090398] [2024-11-19 22:24:14,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214090398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:14,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:14,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:14,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432719734] [2024-11-19 22:24:14,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:14,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:14,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:14,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:14,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:14,346 INFO L87 Difference]: Start difference. First operand 324 states and 451 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-19 22:24:14,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:14,400 INFO L93 Difference]: Finished difference Result 472 states and 674 transitions. [2024-11-19 22:24:14,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:14,401 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 176 [2024-11-19 22:24:14,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:14,403 INFO L225 Difference]: With dead ends: 472 [2024-11-19 22:24:14,403 INFO L226 Difference]: Without dead ends: 307 [2024-11-19 22:24:14,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:14,404 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 35 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:14,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 720 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2024-11-19 22:24:14,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2024-11-19 22:24:14,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 246 states have (on average 1.3252032520325203) internal successors, (326), 250 states have internal predecessors, (326), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-19 22:24:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 424 transitions. [2024-11-19 22:24:14,418 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 424 transitions. Word has length 176 [2024-11-19 22:24:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:14,419 INFO L471 AbstractCegarLoop]: Abstraction has 307 states and 424 transitions. [2024-11-19 22:24:14,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-19 22:24:14,419 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 424 transitions. [2024-11-19 22:24:14,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-19 22:24:14,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:14,421 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:14,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 22:24:14,422 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:14,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:14,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1721529288, now seen corresponding path program 1 times [2024-11-19 22:24:14,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:14,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438868748] [2024-11-19 22:24:14,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:14,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:14,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:14,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:14,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:14,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2024-11-19 22:24:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,598 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2024-11-19 22:24:14,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:14,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438868748] [2024-11-19 22:24:14,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438868748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:14,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:14,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:14,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531070374] [2024-11-19 22:24:14,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:14,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:14,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:14,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:14,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:14,600 INFO L87 Difference]: Start difference. First operand 307 states and 424 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-19 22:24:14,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:14,650 INFO L93 Difference]: Finished difference Result 455 states and 647 transitions. [2024-11-19 22:24:14,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:14,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 178 [2024-11-19 22:24:14,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:14,654 INFO L225 Difference]: With dead ends: 455 [2024-11-19 22:24:14,654 INFO L226 Difference]: Without dead ends: 288 [2024-11-19 22:24:14,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:14,655 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 30 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:14,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 724 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:14,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-19 22:24:14,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-19 22:24:14,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.317391304347826) internal successors, (303), 234 states have internal predecessors, (303), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 22:24:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 395 transitions. [2024-11-19 22:24:14,668 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 395 transitions. Word has length 178 [2024-11-19 22:24:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:14,669 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 395 transitions. [2024-11-19 22:24:14,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-19 22:24:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 395 transitions. [2024-11-19 22:24:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-19 22:24:14,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:14,671 INFO L215 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:14,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 22:24:14,672 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1770335087, now seen corresponding path program 1 times [2024-11-19 22:24:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:14,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236065239] [2024-11-19 22:24:14,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:14,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:14,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:14,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:14,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:14,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:14,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:14,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:14,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-19 22:24:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2024-11-19 22:24:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236065239] [2024-11-19 22:24:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236065239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:24:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303962208] [2024-11-19 22:24:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:14,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:24:14,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:14,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:24:14,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:14,847 INFO L87 Difference]: Start difference. First operand 288 states and 395 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 22:24:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:14,892 INFO L93 Difference]: Finished difference Result 435 states and 617 transitions. [2024-11-19 22:24:14,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:14,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 179 [2024-11-19 22:24:14,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:14,895 INFO L225 Difference]: With dead ends: 435 [2024-11-19 22:24:14,895 INFO L226 Difference]: Without dead ends: 288 [2024-11-19 22:24:14,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:14,897 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:14,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1043 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:14,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-19 22:24:14,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-19 22:24:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 230 states have (on average 1.291304347826087) internal successors, (297), 234 states have internal predecessors, (297), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 22:24:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 389 transitions. [2024-11-19 22:24:14,915 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 389 transitions. Word has length 179 [2024-11-19 22:24:14,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:14,916 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 389 transitions. [2024-11-19 22:24:14,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-19 22:24:14,916 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 389 transitions. [2024-11-19 22:24:14,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 22:24:14,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:14,920 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:14,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 22:24:14,920 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:14,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:14,920 INFO L85 PathProgramCache]: Analyzing trace with hash -984884076, now seen corresponding path program 1 times [2024-11-19 22:24:14,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:14,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032874301] [2024-11-19 22:24:14,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:14,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-19 22:24:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,140 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-19 22:24:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032874301] [2024-11-19 22:24:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032874301] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651453244] [2024-11-19 22:24:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:15,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:15,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:15,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:15,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 22:24:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:24:15,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:15,374 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-19 22:24:15,375 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:24:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2024-11-19 22:24:15,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651453244] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:15,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:24:15,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2024-11-19 22:24:15,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729746028] [2024-11-19 22:24:15,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:15,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:15,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:15,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:15,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:15,529 INFO L87 Difference]: Start difference. First operand 288 states and 389 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 22:24:15,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:15,569 INFO L93 Difference]: Finished difference Result 456 states and 639 transitions. [2024-11-19 22:24:15,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:15,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 186 [2024-11-19 22:24:15,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:15,572 INFO L225 Difference]: With dead ends: 456 [2024-11-19 22:24:15,572 INFO L226 Difference]: Without dead ends: 267 [2024-11-19 22:24:15,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:15,573 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 20 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:15,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 723 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:15,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-19 22:24:15,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-19 22:24:15,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 212 states have (on average 1.2830188679245282) internal successors, (272), 216 states have internal predecessors, (272), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 22:24:15,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 358 transitions. [2024-11-19 22:24:15,584 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 358 transitions. Word has length 186 [2024-11-19 22:24:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:15,584 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 358 transitions. [2024-11-19 22:24:15,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-19 22:24:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 358 transitions. [2024-11-19 22:24:15,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-19 22:24:15,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:15,586 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:15,596 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 22:24:15,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-19 22:24:15,787 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:15,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:15,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1901722937, now seen corresponding path program 1 times [2024-11-19 22:24:15,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:15,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135258941] [2024-11-19 22:24:15,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:15,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:15,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:15,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:15,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:15,955 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-19 22:24:15,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:15,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135258941] [2024-11-19 22:24:15,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135258941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:15,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:15,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:15,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125972416] [2024-11-19 22:24:15,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:15,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:15,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:15,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:15,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:15,957 INFO L87 Difference]: Start difference. First operand 267 states and 358 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 22:24:15,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:15,988 INFO L93 Difference]: Finished difference Result 411 states and 577 transitions. [2024-11-19 22:24:15,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 210 [2024-11-19 22:24:15,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:15,991 INFO L225 Difference]: With dead ends: 411 [2024-11-19 22:24:15,991 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 22:24:15,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:15,992 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 3 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:15,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 764 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 22:24:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2024-11-19 22:24:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 219 states have internal predecessors, (275), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 22:24:16,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 361 transitions. [2024-11-19 22:24:16,004 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 361 transitions. Word has length 210 [2024-11-19 22:24:16,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:16,006 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 361 transitions. [2024-11-19 22:24:16,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-11-19 22:24:16,006 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 361 transitions. [2024-11-19 22:24:16,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-19 22:24:16,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:16,008 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 22:24:16,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 22:24:16,009 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:16,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:16,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2012455842, now seen corresponding path program 1 times [2024-11-19 22:24:16,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:16,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048825649] [2024-11-19 22:24:16,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:16,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:16,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:16,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:16,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:16,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,213 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-19 22:24:16,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048825649] [2024-11-19 22:24:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048825649] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206754682] [2024-11-19 22:24:16,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:16,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:16,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:16,216 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:16,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 22:24:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,396 INFO L255 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:24:16,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:16,427 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2024-11-19 22:24:16,427 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:16,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206754682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:16,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:16,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-19 22:24:16,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4447797] [2024-11-19 22:24:16,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:16,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:16,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:16,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:16,431 INFO L87 Difference]: Start difference. First operand 271 states and 361 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-19 22:24:16,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:16,474 INFO L93 Difference]: Finished difference Result 420 states and 585 transitions. [2024-11-19 22:24:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:16,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 217 [2024-11-19 22:24:16,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:16,479 INFO L225 Difference]: With dead ends: 420 [2024-11-19 22:24:16,479 INFO L226 Difference]: Without dead ends: 276 [2024-11-19 22:24:16,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:24:16,480 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 4 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:16,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 766 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:16,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-19 22:24:16,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2024-11-19 22:24:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 219 states have (on average 1.273972602739726) internal successors, (279), 223 states have internal predecessors, (279), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-19 22:24:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 365 transitions. [2024-11-19 22:24:16,496 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 365 transitions. Word has length 217 [2024-11-19 22:24:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:16,497 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 365 transitions. [2024-11-19 22:24:16,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2024-11-19 22:24:16,497 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 365 transitions. [2024-11-19 22:24:16,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-19 22:24:16,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:16,500 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 22:24:16,510 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 22:24:16,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:16,701 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:16,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:16,702 INFO L85 PathProgramCache]: Analyzing trace with hash -323224646, now seen corresponding path program 1 times [2024-11-19 22:24:16,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:16,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227925077] [2024-11-19 22:24:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:16,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:16,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:16,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:16,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:16,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:16,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:16,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-19 22:24:16,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227925077] [2024-11-19 22:24:16,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227925077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:16,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16716947] [2024-11-19 22:24:16,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:16,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:16,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:16,958 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:16,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 22:24:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:24:17,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-11-19 22:24:17,174 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:17,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16716947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:17,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:17,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-19 22:24:17,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080406081] [2024-11-19 22:24:17,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:17,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:17,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:17,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:17,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:17,176 INFO L87 Difference]: Start difference. First operand 276 states and 365 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 22:24:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:17,212 INFO L93 Difference]: Finished difference Result 424 states and 585 transitions. [2024-11-19 22:24:17,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:17,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 225 [2024-11-19 22:24:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:17,214 INFO L225 Difference]: With dead ends: 424 [2024-11-19 22:24:17,215 INFO L226 Difference]: Without dead ends: 275 [2024-11-19 22:24:17,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:24:17,216 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 5 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:17,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 756 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:17,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-19 22:24:17,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-19 22:24:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 219 states have (on average 1.2602739726027397) internal successors, (276), 222 states have internal predecessors, (276), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-19 22:24:17,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 360 transitions. [2024-11-19 22:24:17,231 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 360 transitions. Word has length 225 [2024-11-19 22:24:17,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:17,231 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 360 transitions. [2024-11-19 22:24:17,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-19 22:24:17,232 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 360 transitions. [2024-11-19 22:24:17,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-19 22:24:17,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:17,235 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 22:24:17,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 22:24:17,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:17,436 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:17,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:17,436 INFO L85 PathProgramCache]: Analyzing trace with hash -270122890, now seen corresponding path program 1 times [2024-11-19 22:24:17,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:17,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189118010] [2024-11-19 22:24:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:17,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:17,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:17,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:17,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:17,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:17,649 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-19 22:24:17,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:17,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189118010] [2024-11-19 22:24:17,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189118010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:17,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:17,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:17,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454015837] [2024-11-19 22:24:17,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:17,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:17,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:17,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:17,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:17,651 INFO L87 Difference]: Start difference. First operand 275 states and 360 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 22:24:17,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:17,920 INFO L93 Difference]: Finished difference Result 422 states and 574 transitions. [2024-11-19 22:24:17,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 22:24:17,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 232 [2024-11-19 22:24:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:17,924 INFO L225 Difference]: With dead ends: 422 [2024-11-19 22:24:17,924 INFO L226 Difference]: Without dead ends: 274 [2024-11-19 22:24:17,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:17,925 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 62 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:17,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 473 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:24:17,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-19 22:24:17,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2024-11-19 22:24:17,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 219 states have (on average 1.2557077625570776) internal successors, (275), 221 states have internal predecessors, (275), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-19 22:24:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 357 transitions. [2024-11-19 22:24:17,947 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 357 transitions. Word has length 232 [2024-11-19 22:24:17,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:17,948 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 357 transitions. [2024-11-19 22:24:17,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-19 22:24:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 357 transitions. [2024-11-19 22:24:17,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-19 22:24:17,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:17,951 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-19 22:24:17,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 22:24:17,951 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:17,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:17,952 INFO L85 PathProgramCache]: Analyzing trace with hash 28448745, now seen corresponding path program 1 times [2024-11-19 22:24:17,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:17,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767709116] [2024-11-19 22:24:17,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:17,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:18,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:18,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:18,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:18,229 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2024-11-19 22:24:18,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:18,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767709116] [2024-11-19 22:24:18,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767709116] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:18,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:18,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:24:18,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150628679] [2024-11-19 22:24:18,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:18,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:24:18,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:18,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:24:18,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:18,232 INFO L87 Difference]: Start difference. First operand 274 states and 357 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 22:24:18,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:18,862 INFO L93 Difference]: Finished difference Result 634 states and 855 transitions. [2024-11-19 22:24:18,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:24:18,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 235 [2024-11-19 22:24:18,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:18,866 INFO L225 Difference]: With dead ends: 634 [2024-11-19 22:24:18,867 INFO L226 Difference]: Without dead ends: 487 [2024-11-19 22:24:18,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:24:18,868 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 421 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:18,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 621 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:24:18,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-11-19 22:24:18,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 481. [2024-11-19 22:24:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 379 states have (on average 1.3087071240105541) internal successors, (496), 381 states have internal predecessors, (496), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-19 22:24:18,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 636 transitions. [2024-11-19 22:24:18,915 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 636 transitions. Word has length 235 [2024-11-19 22:24:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:18,916 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 636 transitions. [2024-11-19 22:24:18,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-19 22:24:18,916 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 636 transitions. [2024-11-19 22:24:18,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-19 22:24:18,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:18,919 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:18,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 22:24:18,919 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:18,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 443330850, now seen corresponding path program 1 times [2024-11-19 22:24:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:18,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155201511] [2024-11-19 22:24:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:18,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:19,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:19,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:19,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:19,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2024-11-19 22:24:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-19 22:24:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-19 22:24:19,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-19 22:24:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,161 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-19 22:24:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155201511] [2024-11-19 22:24:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155201511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:19,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687395772] [2024-11-19 22:24:19,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:19,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:19,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:19,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:19,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:19,163 INFO L87 Difference]: Start difference. First operand 481 states and 636 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 22:24:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:19,645 INFO L93 Difference]: Finished difference Result 1052 states and 1442 transitions. [2024-11-19 22:24:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 266 [2024-11-19 22:24:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:19,652 INFO L225 Difference]: With dead ends: 1052 [2024-11-19 22:24:19,652 INFO L226 Difference]: Without dead ends: 770 [2024-11-19 22:24:19,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:19,653 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 224 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:19,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 469 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:24:19,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2024-11-19 22:24:19,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 601. [2024-11-19 22:24:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 474 states have (on average 1.3164556962025316) internal successors, (624), 480 states have internal predecessors, (624), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2024-11-19 22:24:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 794 transitions. [2024-11-19 22:24:19,706 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 794 transitions. Word has length 266 [2024-11-19 22:24:19,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:19,707 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 794 transitions. [2024-11-19 22:24:19,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 22:24:19,707 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 794 transitions. [2024-11-19 22:24:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-19 22:24:19,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:19,710 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-19 22:24:19,711 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:19,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:19,711 INFO L85 PathProgramCache]: Analyzing trace with hash 363579022, now seen corresponding path program 1 times [2024-11-19 22:24:19,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:19,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291999139] [2024-11-19 22:24:19,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:19,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:19,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:19,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:19,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2024-11-19 22:24:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-19 22:24:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-19 22:24:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-19 22:24:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-19 22:24:19,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:19,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291999139] [2024-11-19 22:24:19,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291999139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:19,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:19,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:19,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525012081] [2024-11-19 22:24:19,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:19,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:19,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:19,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:19,909 INFO L87 Difference]: Start difference. First operand 601 states and 794 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 22:24:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:20,401 INFO L93 Difference]: Finished difference Result 1329 states and 1806 transitions. [2024-11-19 22:24:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 267 [2024-11-19 22:24:20,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:20,408 INFO L225 Difference]: With dead ends: 1329 [2024-11-19 22:24:20,409 INFO L226 Difference]: Without dead ends: 960 [2024-11-19 22:24:20,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:20,411 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 225 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:20,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 497 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:24:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2024-11-19 22:24:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 952. [2024-11-19 22:24:20,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 745 states have (on average 1.3436241610738255) internal successors, (1001), 759 states have internal predecessors, (1001), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2024-11-19 22:24:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1279 transitions. [2024-11-19 22:24:20,498 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1279 transitions. Word has length 267 [2024-11-19 22:24:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:20,499 INFO L471 AbstractCegarLoop]: Abstraction has 952 states and 1279 transitions. [2024-11-19 22:24:20,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-19 22:24:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1279 transitions. [2024-11-19 22:24:20,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-19 22:24:20,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:20,503 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:20,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 22:24:20,504 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:20,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:20,504 INFO L85 PathProgramCache]: Analyzing trace with hash -947160963, now seen corresponding path program 1 times [2024-11-19 22:24:20,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:20,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709775222] [2024-11-19 22:24:20,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:20,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:20,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:20,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-19 22:24:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-19 22:24:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-19 22:24:20,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:20,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709775222] [2024-11-19 22:24:20,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709775222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:20,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:20,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 22:24:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56239328] [2024-11-19 22:24:20,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:20,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:20,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 22:24:20,666 INFO L87 Difference]: Start difference. First operand 952 states and 1279 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 22:24:21,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:21,157 INFO L93 Difference]: Finished difference Result 2220 states and 3057 transitions. [2024-11-19 22:24:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:21,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 268 [2024-11-19 22:24:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:21,166 INFO L225 Difference]: With dead ends: 2220 [2024-11-19 22:24:21,166 INFO L226 Difference]: Without dead ends: 1540 [2024-11-19 22:24:21,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:21,169 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 225 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:21,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 524 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 22:24:21,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2024-11-19 22:24:21,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1526. [2024-11-19 22:24:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3689974726200504) internal successors, (1625), 1215 states have internal predecessors, (1625), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-19 22:24:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2087 transitions. [2024-11-19 22:24:21,303 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2087 transitions. Word has length 268 [2024-11-19 22:24:21,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:21,303 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2087 transitions. [2024-11-19 22:24:21,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 22:24:21,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2087 transitions. [2024-11-19 22:24:21,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-19 22:24:21,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:21,308 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:21,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-19 22:24:21,308 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:21,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:21,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1341527749, now seen corresponding path program 1 times [2024-11-19 22:24:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:21,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356217569] [2024-11-19 22:24:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:21,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:21,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:21,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:21,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:21,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:21,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-19 22:24:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-19 22:24:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2024-11-19 22:24:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356217569] [2024-11-19 22:24:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356217569] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116886630] [2024-11-19 22:24:21,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:21,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:21,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:21,610 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:21,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 22:24:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:21,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 947 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 22:24:21,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2024-11-19 22:24:21,896 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:21,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116886630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:21,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:21,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-19 22:24:21,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961757713] [2024-11-19 22:24:21,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:21,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:21,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:21,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:21,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:24:21,899 INFO L87 Difference]: Start difference. First operand 1526 states and 2087 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 22:24:22,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:22,110 INFO L93 Difference]: Finished difference Result 2820 states and 3914 transitions. [2024-11-19 22:24:22,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:22,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 268 [2024-11-19 22:24:22,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:22,120 INFO L225 Difference]: With dead ends: 2820 [2024-11-19 22:24:22,120 INFO L226 Difference]: Without dead ends: 1526 [2024-11-19 22:24:22,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:24:22,125 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 31 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:22,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 691 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 22:24:22,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1526 states. [2024-11-19 22:24:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1526 to 1526. [2024-11-19 22:24:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1187 states have (on average 1.3487784330244312) internal successors, (1601), 1215 states have internal predecessors, (1601), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-19 22:24:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 2063 transitions. [2024-11-19 22:24:22,231 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 2063 transitions. Word has length 268 [2024-11-19 22:24:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:22,232 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 2063 transitions. [2024-11-19 22:24:22,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 22:24:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 2063 transitions. [2024-11-19 22:24:22,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-11-19 22:24:22,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:22,236 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:22,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 22:24:22,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-19 22:24:22,440 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:22,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:22,441 INFO L85 PathProgramCache]: Analyzing trace with hash 731956630, now seen corresponding path program 1 times [2024-11-19 22:24:22,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:22,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769495519] [2024-11-19 22:24:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:22,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:22,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:22,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-19 22:24:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-19 22:24:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,769 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2024-11-19 22:24:22,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:22,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769495519] [2024-11-19 22:24:22,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769495519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:22,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488361394] [2024-11-19 22:24:22,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:22,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:22,772 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:22,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 22:24:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:22,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 948 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 22:24:22,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:23,025 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-19 22:24:23,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:23,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488361394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:23,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:23,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-19 22:24:23,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798896969] [2024-11-19 22:24:23,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:23,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:23,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:23,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:23,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:24:23,028 INFO L87 Difference]: Start difference. First operand 1526 states and 2063 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 22:24:23,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:23,173 INFO L93 Difference]: Finished difference Result 2820 states and 3858 transitions. [2024-11-19 22:24:23,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 269 [2024-11-19 22:24:23,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:23,186 INFO L225 Difference]: With dead ends: 2820 [2024-11-19 22:24:23,186 INFO L226 Difference]: Without dead ends: 1574 [2024-11-19 22:24:23,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 22:24:23,191 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 7 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:23,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 699 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:23,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-11-19 22:24:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1574. [2024-11-19 22:24:23,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1227 states have (on average 1.3504482477587612) internal successors, (1657), 1255 states have internal predecessors, (1657), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2024-11-19 22:24:23,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 2119 transitions. [2024-11-19 22:24:23,295 INFO L78 Accepts]: Start accepts. Automaton has 1574 states and 2119 transitions. Word has length 269 [2024-11-19 22:24:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:23,296 INFO L471 AbstractCegarLoop]: Abstraction has 1574 states and 2119 transitions. [2024-11-19 22:24:23,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-19 22:24:23,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1574 states and 2119 transitions. [2024-11-19 22:24:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2024-11-19 22:24:23,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:23,300 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:23,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-19 22:24:23,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-19 22:24:23,501 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:23,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:23,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1189094123, now seen corresponding path program 1 times [2024-11-19 22:24:23,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:23,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112028137] [2024-11-19 22:24:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:23,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:23,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:23,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:23,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:23,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:23,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:23,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:23,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-19 22:24:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-19 22:24:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:23,933 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2024-11-19 22:24:23,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:23,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112028137] [2024-11-19 22:24:23,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112028137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:23,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:23,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:24:23,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103984498] [2024-11-19 22:24:23,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:23,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:24:23,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:23,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:24:23,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:24:23,937 INFO L87 Difference]: Start difference. First operand 1574 states and 2119 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 22:24:24,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:24,624 INFO L93 Difference]: Finished difference Result 2404 states and 3466 transitions. [2024-11-19 22:24:24,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:24:24,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 270 [2024-11-19 22:24:24,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:24,641 INFO L225 Difference]: With dead ends: 2404 [2024-11-19 22:24:24,641 INFO L226 Difference]: Without dead ends: 2402 [2024-11-19 22:24:24,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:24:24,644 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 181 mSDsluCounter, 1210 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:24,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1528 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:24:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2024-11-19 22:24:24,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1622. [2024-11-19 22:24:24,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1259 states have (on average 1.34154090548054) internal successors, (1689), 1295 states have internal predecessors, (1689), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2024-11-19 22:24:24,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2167 transitions. [2024-11-19 22:24:24,808 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2167 transitions. Word has length 270 [2024-11-19 22:24:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:24,808 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2167 transitions. [2024-11-19 22:24:24,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-19 22:24:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2167 transitions. [2024-11-19 22:24:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-19 22:24:24,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:24,811 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:24,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 22:24:24,811 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:24,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:24,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1337818136, now seen corresponding path program 1 times [2024-11-19 22:24:24,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:24,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144618610] [2024-11-19 22:24:24,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:24,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:24,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:25,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:25,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:25,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:25,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:25,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-19 22:24:25,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-19 22:24:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-19 22:24:25,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,196 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-19 22:24:25,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:25,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144618610] [2024-11-19 22:24:25,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144618610] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:25,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901646531] [2024-11-19 22:24:25,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:25,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:25,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:25,199 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:25,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 22:24:25,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:25,444 INFO L255 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 22:24:25,450 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:25,655 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-19 22:24:25,655 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:24:26,055 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-11-19 22:24:26,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901646531] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:24:26,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:24:26,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2024-11-19 22:24:26,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206642572] [2024-11-19 22:24:26,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:24:26,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 22:24:26,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:26,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 22:24:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:24:26,058 INFO L87 Difference]: Start difference. First operand 1622 states and 2167 transitions. Second operand has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-19 22:24:28,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:28,026 INFO L93 Difference]: Finished difference Result 3978 states and 5504 transitions. [2024-11-19 22:24:28,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 22:24:28,026 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 278 [2024-11-19 22:24:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:28,049 INFO L225 Difference]: With dead ends: 3978 [2024-11-19 22:24:28,049 INFO L226 Difference]: Without dead ends: 2636 [2024-11-19 22:24:28,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 638 GetRequests, 601 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=176, Invalid=1014, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 22:24:28,056 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 304 mSDsluCounter, 2497 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 2740 SdHoareTripleChecker+Invalid, 2237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:28,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 2740 Invalid, 2237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 22:24:28,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2024-11-19 22:24:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2408. [2024-11-19 22:24:28,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2408 states, 1862 states have (on average 1.3286788399570355) internal successors, (2474), 1914 states have internal predecessors, (2474), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2024-11-19 22:24:28,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2408 states to 2408 states and 3194 transitions. [2024-11-19 22:24:28,300 INFO L78 Accepts]: Start accepts. Automaton has 2408 states and 3194 transitions. Word has length 278 [2024-11-19 22:24:28,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:28,301 INFO L471 AbstractCegarLoop]: Abstraction has 2408 states and 3194 transitions. [2024-11-19 22:24:28,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.947368421052632) internal successors, (151), 14 states have internal predecessors, (151), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2024-11-19 22:24:28,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2408 states and 3194 transitions. [2024-11-19 22:24:28,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-19 22:24:28,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:28,305 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:28,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-19 22:24:28,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:28,507 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:28,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:28,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1995535143, now seen corresponding path program 1 times [2024-11-19 22:24:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:28,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183442463] [2024-11-19 22:24:28,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:28,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:28,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:28,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:28,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-19 22:24:28,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-19 22:24:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-19 22:24:28,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2024-11-19 22:24:28,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183442463] [2024-11-19 22:24:28,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183442463] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761774149] [2024-11-19 22:24:28,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:28,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:28,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:28,700 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:28,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 22:24:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:28,909 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:24:28,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2024-11-19 22:24:28,927 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761774149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-19 22:24:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692052444] [2024-11-19 22:24:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:28,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:28,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:28,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:28,931 INFO L87 Difference]: Start difference. First operand 2408 states and 3194 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 22:24:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:29,149 INFO L93 Difference]: Finished difference Result 4649 states and 6264 transitions. [2024-11-19 22:24:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 278 [2024-11-19 22:24:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:29,162 INFO L225 Difference]: With dead ends: 4649 [2024-11-19 22:24:29,162 INFO L226 Difference]: Without dead ends: 2344 [2024-11-19 22:24:29,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:24:29,168 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 4 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:29,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 699 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:29,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2344 states. [2024-11-19 22:24:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2344 to 2344. [2024-11-19 22:24:29,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2344 states, 1818 states have (on average 1.3113311331133113) internal successors, (2384), 1870 states have internal predecessors, (2384), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2024-11-19 22:24:29,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2344 states to 2344 states and 3068 transitions. [2024-11-19 22:24:29,321 INFO L78 Accepts]: Start accepts. Automaton has 2344 states and 3068 transitions. Word has length 278 [2024-11-19 22:24:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:29,322 INFO L471 AbstractCegarLoop]: Abstraction has 2344 states and 3068 transitions. [2024-11-19 22:24:29,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 22:24:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2344 states and 3068 transitions. [2024-11-19 22:24:29,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2024-11-19 22:24:29,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:29,326 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:29,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 22:24:29,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:29,527 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:29,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:29,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1834324692, now seen corresponding path program 1 times [2024-11-19 22:24:29,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:29,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988064734] [2024-11-19 22:24:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:29,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:29,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:29,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:29,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-19 22:24:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 22:24:29,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-11-19 22:24:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-19 22:24:29,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2024-11-19 22:24:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-19 22:24:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-19 22:24:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-19 22:24:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-19 22:24:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-19 22:24:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-19 22:24:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,708 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2024-11-19 22:24:29,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:29,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988064734] [2024-11-19 22:24:29,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988064734] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:29,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309381099] [2024-11-19 22:24:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:29,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:29,712 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:29,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 22:24:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:29,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 22:24:29,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:29,968 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2024-11-19 22:24:29,968 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:29,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309381099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:29,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:29,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-19 22:24:29,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463949061] [2024-11-19 22:24:29,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:29,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 22:24:29,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:29,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 22:24:29,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:29,971 INFO L87 Difference]: Start difference. First operand 2344 states and 3068 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 22:24:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:30,138 INFO L93 Difference]: Finished difference Result 4431 states and 5905 transitions. [2024-11-19 22:24:30,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 22:24:30,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 281 [2024-11-19 22:24:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:30,152 INFO L225 Difference]: With dead ends: 4431 [2024-11-19 22:24:30,152 INFO L226 Difference]: Without dead ends: 2172 [2024-11-19 22:24:30,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:24:30,158 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 4 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:30,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 727 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 22:24:30,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2024-11-19 22:24:30,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2172. [2024-11-19 22:24:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2172 states, 1676 states have (on average 1.3048926014319808) internal successors, (2187), 1728 states have internal predecessors, (2187), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2024-11-19 22:24:30,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2833 transitions. [2024-11-19 22:24:30,320 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2833 transitions. Word has length 281 [2024-11-19 22:24:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:30,321 INFO L471 AbstractCegarLoop]: Abstraction has 2172 states and 2833 transitions. [2024-11-19 22:24:30,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-19 22:24:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2833 transitions. [2024-11-19 22:24:30,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2024-11-19 22:24:30,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:30,324 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:30,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 22:24:30,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:30,529 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:30,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1939290951, now seen corresponding path program 1 times [2024-11-19 22:24:30,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:30,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198413515] [2024-11-19 22:24:30,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:30,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:30,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:30,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-19 22:24:31,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-19 22:24:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-19 22:24:31,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-19 22:24:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2024-11-19 22:24:31,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 719 trivial. 0 not checked. [2024-11-19 22:24:31,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:31,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198413515] [2024-11-19 22:24:31,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198413515] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:31,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [284804401] [2024-11-19 22:24:31,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:31,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:31,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:31,063 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:31,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 22:24:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:31,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 1020 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 22:24:31,295 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2024-11-19 22:24:31,429 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:31,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [284804401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:31,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:31,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-19 22:24:31,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557339278] [2024-11-19 22:24:31,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:31,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:24:31,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:31,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:24:31,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-11-19 22:24:31,432 INFO L87 Difference]: Start difference. First operand 2172 states and 2833 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 22:24:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:31,853 INFO L93 Difference]: Finished difference Result 4802 states and 6272 transitions. [2024-11-19 22:24:31,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:24:31,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 293 [2024-11-19 22:24:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:31,872 INFO L225 Difference]: With dead ends: 4802 [2024-11-19 22:24:31,872 INFO L226 Difference]: Without dead ends: 3196 [2024-11-19 22:24:31,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2024-11-19 22:24:31,878 INFO L432 NwaCegarLoop]: 327 mSDtfsCounter, 128 mSDsluCounter, 1409 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:31,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1736 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:24:31,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2024-11-19 22:24:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 3182. [2024-11-19 22:24:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 2447 states have (on average 1.298324478953821) internal successors, (3177), 2527 states have internal predecessors, (3177), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2024-11-19 22:24:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4111 transitions. [2024-11-19 22:24:32,112 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4111 transitions. Word has length 293 [2024-11-19 22:24:32,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:32,112 INFO L471 AbstractCegarLoop]: Abstraction has 3182 states and 4111 transitions. [2024-11-19 22:24:32,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 7 states have internal predecessors, (108), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 22:24:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4111 transitions. [2024-11-19 22:24:32,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-19 22:24:32,115 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:32,116 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:32,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-19 22:24:32,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-19 22:24:32,320 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:32,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:32,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1839544214, now seen corresponding path program 1 times [2024-11-19 22:24:32,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:32,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990298879] [2024-11-19 22:24:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:32,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:32,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:32,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:32,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:32,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:32,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:32,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:32,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:32,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:32,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-19 22:24:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-19 22:24:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-19 22:24:32,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-19 22:24:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-19 22:24:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-19 22:24:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:32,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990298879] [2024-11-19 22:24:32,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990298879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:32,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:32,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 22:24:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265571576] [2024-11-19 22:24:32,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:32,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 22:24:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:32,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 22:24:32,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:24:32,589 INFO L87 Difference]: Start difference. First operand 3182 states and 4111 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 22:24:33,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:33,062 INFO L93 Difference]: Finished difference Result 6182 states and 8177 transitions. [2024-11-19 22:24:33,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 22:24:33,063 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 299 [2024-11-19 22:24:33,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:33,078 INFO L225 Difference]: With dead ends: 6182 [2024-11-19 22:24:33,078 INFO L226 Difference]: Without dead ends: 3506 [2024-11-19 22:24:33,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 22:24:33,084 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 93 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:33,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 822 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:24:33,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2024-11-19 22:24:33,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3438. [2024-11-19 22:24:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 2655 states have (on average 1.3111111111111111) internal successors, (3481), 2735 states have internal predecessors, (3481), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2024-11-19 22:24:33,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 4511 transitions. [2024-11-19 22:24:33,298 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 4511 transitions. Word has length 299 [2024-11-19 22:24:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:33,298 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 4511 transitions. [2024-11-19 22:24:33,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-19 22:24:33,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 4511 transitions. [2024-11-19 22:24:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-19 22:24:33,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:33,302 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:33,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 22:24:33,302 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:33,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:33,303 INFO L85 PathProgramCache]: Analyzing trace with hash 9129234, now seen corresponding path program 1 times [2024-11-19 22:24:33,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:33,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029765077] [2024-11-19 22:24:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:33,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:33,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:33,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:33,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:33,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:33,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:33,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:33,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:33,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2024-11-19 22:24:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-19 22:24:33,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-19 22:24:33,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-19 22:24:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-19 22:24:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-19 22:24:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-19 22:24:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2024-11-19 22:24:33,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:33,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029765077] [2024-11-19 22:24:33,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029765077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:33,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:33,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 22:24:33,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728989402] [2024-11-19 22:24:33,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:33,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 22:24:33,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:33,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 22:24:33,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 22:24:33,729 INFO L87 Difference]: Start difference. First operand 3438 states and 4511 transitions. Second operand has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 22:24:34,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:34,193 INFO L93 Difference]: Finished difference Result 6215 states and 8207 transitions. [2024-11-19 22:24:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 22:24:34,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 299 [2024-11-19 22:24:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:34,212 INFO L225 Difference]: With dead ends: 6215 [2024-11-19 22:24:34,212 INFO L226 Difference]: Without dead ends: 3384 [2024-11-19 22:24:34,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:24:34,222 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 61 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:34,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 781 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 22:24:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2024-11-19 22:24:34,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3384. [2024-11-19 22:24:34,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3384 states, 2610 states have (on average 1.3080459770114943) internal successors, (3414), 2685 states have internal predecessors, (3414), 511 states have call successors, (511), 263 states have call predecessors, (511), 262 states have return successors, (510), 442 states have call predecessors, (510), 510 states have call successors, (510) [2024-11-19 22:24:34,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 4435 transitions. [2024-11-19 22:24:34,624 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 4435 transitions. Word has length 299 [2024-11-19 22:24:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:34,626 INFO L471 AbstractCegarLoop]: Abstraction has 3384 states and 4435 transitions. [2024-11-19 22:24:34,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-19 22:24:34,626 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 4435 transitions. [2024-11-19 22:24:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-19 22:24:34,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:34,631 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:34,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-19 22:24:34,634 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:34,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:34,634 INFO L85 PathProgramCache]: Analyzing trace with hash -788096576, now seen corresponding path program 1 times [2024-11-19 22:24:34,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:34,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249805786] [2024-11-19 22:24:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:34,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:34,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:34,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:34,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:35,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-19 22:24:35,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-19 22:24:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-19 22:24:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-19 22:24:35,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-19 22:24:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-19 22:24:35,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-19 22:24:35,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-11-19 22:24:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-19 22:24:35,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249805786] [2024-11-19 22:24:35,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249805786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:35,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407753814] [2024-11-19 22:24:35,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:35,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:35,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:35,062 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:35,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 22:24:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:35,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 22:24:35,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:35,529 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2024-11-19 22:24:35,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:24:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-19 22:24:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407753814] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:35,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-19 22:24:35,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 10] total 18 [2024-11-19 22:24:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689631552] [2024-11-19 22:24:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:35,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 22:24:35,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:35,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 22:24:35,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2024-11-19 22:24:35,727 INFO L87 Difference]: Start difference. First operand 3384 states and 4435 transitions. Second operand has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 22:24:36,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:36,750 INFO L93 Difference]: Finished difference Result 10534 states and 13758 transitions. [2024-11-19 22:24:36,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 22:24:36,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2024-11-19 22:24:36,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:36,782 INFO L225 Difference]: With dead ends: 10534 [2024-11-19 22:24:36,782 INFO L226 Difference]: Without dead ends: 7670 [2024-11-19 22:24:36,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 656 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2024-11-19 22:24:36,793 INFO L432 NwaCegarLoop]: 376 mSDtfsCounter, 667 mSDsluCounter, 2359 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:36,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 2735 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 22:24:36,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7670 states. [2024-11-19 22:24:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7670 to 5490. [2024-11-19 22:24:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5490 states, 4214 states have (on average 1.3028001898433792) internal successors, (5490), 4334 states have internal predecessors, (5490), 852 states have call successors, (852), 424 states have call predecessors, (852), 423 states have return successors, (851), 738 states have call predecessors, (851), 851 states have call successors, (851) [2024-11-19 22:24:37,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5490 states to 5490 states and 7193 transitions. [2024-11-19 22:24:37,257 INFO L78 Accepts]: Start accepts. Automaton has 5490 states and 7193 transitions. Word has length 304 [2024-11-19 22:24:37,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:37,258 INFO L471 AbstractCegarLoop]: Abstraction has 5490 states and 7193 transitions. [2024-11-19 22:24:37,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.8) internal successors, (98), 9 states have internal predecessors, (98), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 22:24:37,258 INFO L276 IsEmpty]: Start isEmpty. Operand 5490 states and 7193 transitions. [2024-11-19 22:24:37,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-19 22:24:37,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:37,262 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:37,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 22:24:37,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-19 22:24:37,466 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:37,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:37,466 INFO L85 PathProgramCache]: Analyzing trace with hash -112763456, now seen corresponding path program 1 times [2024-11-19 22:24:37,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:37,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868583068] [2024-11-19 22:24:37,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:37,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:37,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:37,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:37,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:37,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:37,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:37,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:37,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-19 22:24:37,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-19 22:24:37,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:37,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-19 22:24:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-19 22:24:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-19 22:24:37,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-19 22:24:37,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-19 22:24:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2024-11-19 22:24:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2024-11-19 22:24:37,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868583068] [2024-11-19 22:24:37,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868583068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960294916] [2024-11-19 22:24:37,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:37,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:37,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:37,791 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:37,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-19 22:24:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:38,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 1048 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 22:24:38,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:38,098 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2024-11-19 22:24:38,098 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 22:24:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960294916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 22:24:38,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10 [2024-11-19 22:24:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387779906] [2024-11-19 22:24:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:38,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 22:24:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:38,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 22:24:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-19 22:24:38,100 INFO L87 Difference]: Start difference. First operand 5490 states and 7193 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 22:24:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:38,603 INFO L93 Difference]: Finished difference Result 10586 states and 13865 transitions. [2024-11-19 22:24:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:24:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 304 [2024-11-19 22:24:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:38,630 INFO L225 Difference]: With dead ends: 10586 [2024-11-19 22:24:38,630 INFO L226 Difference]: Without dead ends: 5568 [2024-11-19 22:24:38,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-19 22:24:38,645 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 122 mSDsluCounter, 1387 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1709 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:38,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1709 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 22:24:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5568 states. [2024-11-19 22:24:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5568 to 5326. [2024-11-19 22:24:39,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5326 states, 4090 states have (on average 1.2953545232273838) internal successors, (5298), 4206 states have internal predecessors, (5298), 816 states have call successors, (816), 420 states have call predecessors, (816), 419 states have return successors, (815), 706 states have call predecessors, (815), 815 states have call successors, (815) [2024-11-19 22:24:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5326 states to 5326 states and 6929 transitions. [2024-11-19 22:24:39,182 INFO L78 Accepts]: Start accepts. Automaton has 5326 states and 6929 transitions. Word has length 304 [2024-11-19 22:24:39,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:39,183 INFO L471 AbstractCegarLoop]: Abstraction has 5326 states and 6929 transitions. [2024-11-19 22:24:39,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 7 states have internal predecessors, (114), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2024-11-19 22:24:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 5326 states and 6929 transitions. [2024-11-19 22:24:39,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2024-11-19 22:24:39,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:39,188 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 22:24:39,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-19 22:24:39,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-19 22:24:39,393 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash -446467712, now seen corresponding path program 1 times [2024-11-19 22:24:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164183451] [2024-11-19 22:24:39,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:39,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:39,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:39,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:39,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:39,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:39,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:39,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-19 22:24:39,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-19 22:24:39,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-19 22:24:39,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-19 22:24:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-19 22:24:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-19 22:24:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-19 22:24:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-19 22:24:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2024-11-19 22:24:39,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2024-11-19 22:24:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:39,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164183451] [2024-11-19 22:24:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164183451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 22:24:39,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 22:24:39,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 22:24:39,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054534463] [2024-11-19 22:24:39,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 22:24:39,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 22:24:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:39,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 22:24:39,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 22:24:39,658 INFO L87 Difference]: Start difference. First operand 5326 states and 6929 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 22:24:40,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 22:24:40,643 INFO L93 Difference]: Finished difference Result 8964 states and 11706 transitions. [2024-11-19 22:24:40,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 22:24:40,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 311 [2024-11-19 22:24:40,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 22:24:40,664 INFO L225 Difference]: With dead ends: 8964 [2024-11-19 22:24:40,665 INFO L226 Difference]: Without dead ends: 4406 [2024-11-19 22:24:40,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 22:24:40,675 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 475 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 758 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 22:24:40,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 758 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 22:24:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4406 states. [2024-11-19 22:24:41,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 4380. [2024-11-19 22:24:41,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4380 states, 3369 states have (on average 1.2766399525081626) internal successors, (4301), 3463 states have internal predecessors, (4301), 665 states have call successors, (665), 345 states have call predecessors, (665), 345 states have return successors, (665), 571 states have call predecessors, (665), 665 states have call successors, (665) [2024-11-19 22:24:41,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 5631 transitions. [2024-11-19 22:24:41,048 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 5631 transitions. Word has length 311 [2024-11-19 22:24:41,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 22:24:41,049 INFO L471 AbstractCegarLoop]: Abstraction has 4380 states and 5631 transitions. [2024-11-19 22:24:41,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-19 22:24:41,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 5631 transitions. [2024-11-19 22:24:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-19 22:24:41,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 22:24:41,057 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 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, 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] [2024-11-19 22:24:41,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-19 22:24:41,057 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 22:24:41,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 22:24:41,058 INFO L85 PathProgramCache]: Analyzing trace with hash -409137599, now seen corresponding path program 1 times [2024-11-19 22:24:41,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 22:24:41,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116880457] [2024-11-19 22:24:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:41,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 22:24:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:41,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-19 22:24:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-19 22:24:42,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-19 22:24:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 22:24:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-19 22:24:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 22:24:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-19 22:24:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 22:24:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 22:24:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-19 22:24:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-19 22:24:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-19 22:24:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 22:24:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-11-19 22:24:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-19 22:24:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-19 22:24:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-11-19 22:24:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-19 22:24:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2024-11-19 22:24:42,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-11-19 22:24:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-19 22:24:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-19 22:24:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-19 22:24:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-19 22:24:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-19 22:24:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-19 22:24:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-11-19 22:24:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2024-11-19 22:24:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2024-11-19 22:24:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2024-11-19 22:24:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2024-11-19 22:24:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2024-11-19 22:24:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2024-11-19 22:24:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2024-11-19 22:24:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 22 proven. 28 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2024-11-19 22:24:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 22:24:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116880457] [2024-11-19 22:24:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116880457] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 22:24:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822641109] [2024-11-19 22:24:42,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 22:24:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 22:24:42,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 22:24:42,172 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 22:24:42,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-19 22:24:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 22:24:42,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 1339 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 22:24:42,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 22:24:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 211 proven. 122 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2024-11-19 22:24:43,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 22:24:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 915 backedges. 14 proven. 28 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-11-19 22:24:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822641109] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 22:24:44,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 22:24:44,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 18] total 44 [2024-11-19 22:24:44,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599791679] [2024-11-19 22:24:44,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 22:24:44,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-19 22:24:44,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 22:24:44,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-19 22:24:44,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1737, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 22:24:44,317 INFO L87 Difference]: Start difference. First operand 4380 states and 5631 transitions. Second operand has 44 states, 43 states have (on average 7.116279069767442) internal successors, (306), 39 states have internal predecessors, (306), 20 states have call successors, (72), 9 states have call predecessors, (72), 10 states have return successors, (68), 22 states have call predecessors, (68), 19 states have call successors, (68)