./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/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())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '64bit', '--witnessprinter.graph.data.programhash', '0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 64bit --witnessprinter.graph.data.programhash 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:34:24,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:34:24,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:34:24,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:34:24,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:34:24,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:34:24,655 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:34:24,655 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:34:24,656 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:34:24,656 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:34:24,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:34:24,656 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:34:24,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:34:24,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:34:24,657 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:34:24,657 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709 [2024-11-07 03:34:24,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:34:24,894 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:34:24,897 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:34:24,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:34:24,899 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:34:24,900 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2024-11-07 03:34:26,039 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:34:26,282 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:34:26,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2024-11-07 03:34:26,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7ac38363/e0fb9fa82d0d4f1ba47b1c93f884602c/FLAGe762531db [2024-11-07 03:34:26,305 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f7ac38363/e0fb9fa82d0d4f1ba47b1c93f884602c [2024-11-07 03:34:26,308 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:34:26,309 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:34:26,311 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:34:26,311 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:34:26,315 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:34:26,316 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:26,317 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22deb575 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26, skipping insertion in model container [2024-11-07 03:34:26,317 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:26,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:34:26,472 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2024-11-07 03:34:26,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:34:26,668 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:34:26,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324] [2024-11-07 03:34:26,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:34:26,799 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:34:26,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26 WrapperNode [2024-11-07 03:34:26,800 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:34:26,801 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:34:26,801 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:34:26,801 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:34:26,806 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:26,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:26,997 INFO L138 Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1980 [2024-11-07 03:34:26,998 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:34:26,999 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:34:26,999 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:34:26,999 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:34:27,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,034 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,094 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-07 03:34:27,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,094 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,135 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,180 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:34:27,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:34:27,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:34:27,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:34:27,268 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (1/1) ... [2024-11-07 03:34:27,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:34:27,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:34:27,300 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 03:34:27,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 03:34:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:34:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:34:27,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:34:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:34:27,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:34:27,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:34:27,513 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:34:27,515 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:34:29,630 INFO L? ?]: Removed 1004 outVars from TransFormulas that were not future-live. [2024-11-07 03:34:29,631 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:34:29,657 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:34:29,657 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:34:29,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:34:29 BoogieIcfgContainer [2024-11-07 03:34:29,661 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:34:29,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:34:29,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:34:29,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:34:29,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:34:26" (1/3) ... [2024-11-07 03:34:29,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d547fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:34:29, skipping insertion in model container [2024-11-07 03:34:29,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:34:26" (2/3) ... [2024-11-07 03:34:29,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d547fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:34:29, skipping insertion in model container [2024-11-07 03:34:29,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:34:29" (3/3) ... [2024-11-07 03:34:29,670 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c [2024-11-07 03:34:29,683 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:34:29,683 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:34:29,754 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:34:29,764 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;@63b862c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:34:29,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:34:29,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 672 states, 667 states have (on average 1.5037481259370316) internal successors, (1003), 668 states have internal predecessors, (1003), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 03:34:29,790 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:29,791 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:29,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:29,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:29,796 INFO L85 PathProgramCache]: Analyzing trace with hash -333646520, now seen corresponding path program 1 times [2024-11-07 03:34:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:29,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272054364] [2024-11-07 03:34:29,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:29,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:30,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:30,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 03:34:30,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:30,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:30,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:30,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272054364] [2024-11-07 03:34:30,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272054364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:30,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:30,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:34:30,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431211357] [2024-11-07 03:34:30,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:30,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:34:30,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:30,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:34:30,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:34:30,280 INFO L87 Difference]: Start difference. First operand has 672 states, 667 states have (on average 1.5037481259370316) internal successors, (1003), 668 states have internal predecessors, (1003), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:30,330 INFO L93 Difference]: Finished difference Result 1307 states and 1964 transitions. [2024-11-07 03:34:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:34:30,332 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 225 [2024-11-07 03:34:30,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:30,340 INFO L225 Difference]: With dead ends: 1307 [2024-11-07 03:34:30,340 INFO L226 Difference]: Without dead ends: 669 [2024-11-07 03:34:30,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:34:30,346 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:30,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2024-11-07 03:34:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669. [2024-11-07 03:34:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 665 states have (on average 1.4887218045112782) internal successors, (990), 665 states have internal predecessors, (990), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:30,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 994 transitions. [2024-11-07 03:34:30,422 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 994 transitions. Word has length 225 [2024-11-07 03:34:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:30,423 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 994 transitions. [2024-11-07 03:34:30,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.0) internal successors, (218), 2 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:30,424 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 994 transitions. [2024-11-07 03:34:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-11-07 03:34:30,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:30,430 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:30,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:34:30,430 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:30,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:30,431 INFO L85 PathProgramCache]: Analyzing trace with hash 617884484, now seen corresponding path program 1 times [2024-11-07 03:34:30,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:30,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170067899] [2024-11-07 03:34:30,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:30,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:31,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:31,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:31,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 03:34:31,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:31,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:31,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:31,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170067899] [2024-11-07 03:34:31,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170067899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:31,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035429917] [2024-11-07 03:34:31,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:31,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:31,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:31,737 INFO L87 Difference]: Start difference. First operand 669 states and 994 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:31,961 INFO L93 Difference]: Finished difference Result 1303 states and 1937 transitions. [2024-11-07 03:34:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 225 [2024-11-07 03:34:31,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:31,968 INFO L225 Difference]: With dead ends: 1303 [2024-11-07 03:34:31,968 INFO L226 Difference]: Without dead ends: 668 [2024-11-07 03:34:31,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-07 03:34:31,970 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 958 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1838 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:31,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1838 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-07 03:34:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2024-11-07 03:34:32,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 664 states have (on average 1.4864457831325302) internal successors, (987), 664 states have internal predecessors, (987), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:32,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 991 transitions. [2024-11-07 03:34:32,007 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 991 transitions. Word has length 225 [2024-11-07 03:34:32,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:32,009 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 991 transitions. [2024-11-07 03:34:32,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 991 transitions. [2024-11-07 03:34:32,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-07 03:34:32,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:32,012 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:32,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:34:32,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:32,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:32,013 INFO L85 PathProgramCache]: Analyzing trace with hash 766505756, now seen corresponding path program 1 times [2024-11-07 03:34:32,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:32,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649501018] [2024-11-07 03:34:32,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:32,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:32,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:32,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:32,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:32,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:32,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:32,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:32,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649501018] [2024-11-07 03:34:32,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649501018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:32,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:32,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:32,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038847540] [2024-11-07 03:34:32,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:32,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:32,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:32,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:32,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:32,574 INFO L87 Difference]: Start difference. First operand 668 states and 991 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:32,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:32,655 INFO L93 Difference]: Finished difference Result 1302 states and 1932 transitions. [2024-11-07 03:34:32,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 226 [2024-11-07 03:34:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:32,660 INFO L225 Difference]: With dead ends: 1302 [2024-11-07 03:34:32,660 INFO L226 Difference]: Without dead ends: 668 [2024-11-07 03:34:32,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-07 03:34:32,663 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 948 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:32,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1952 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:32,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-07 03:34:32,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668. [2024-11-07 03:34:32,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 664 states have (on average 1.4849397590361446) internal successors, (986), 664 states have internal predecessors, (986), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 990 transitions. [2024-11-07 03:34:32,689 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 990 transitions. Word has length 226 [2024-11-07 03:34:32,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:32,689 INFO L471 AbstractCegarLoop]: Abstraction has 668 states and 990 transitions. [2024-11-07 03:34:32,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 990 transitions. [2024-11-07 03:34:32,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-07 03:34:32,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:32,693 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:32,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:34:32,693 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:32,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash 309419697, now seen corresponding path program 1 times [2024-11-07 03:34:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139703874] [2024-11-07 03:34:32,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:32,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:33,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:33,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:33,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:33,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139703874] [2024-11-07 03:34:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139703874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:33,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:33,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:33,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154881938] [2024-11-07 03:34:33,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:33,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:33,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:33,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:33,417 INFO L87 Difference]: Start difference. First operand 668 states and 990 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:33,449 INFO L93 Difference]: Finished difference Result 672 states and 994 transitions. [2024-11-07 03:34:33,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:33,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227 [2024-11-07 03:34:33,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:33,453 INFO L225 Difference]: With dead ends: 672 [2024-11-07 03:34:33,453 INFO L226 Difference]: Without dead ends: 670 [2024-11-07 03:34:33,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:33,454 INFO L432 NwaCegarLoop]: 988 mSDtfsCounter, 0 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2958 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:33,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2958 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-11-07 03:34:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2024-11-07 03:34:33,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 666 states have (on average 1.4834834834834836) internal successors, (988), 666 states have internal predecessors, (988), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:33,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 992 transitions. [2024-11-07 03:34:33,471 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 992 transitions. Word has length 227 [2024-11-07 03:34:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:33,472 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 992 transitions. [2024-11-07 03:34:33,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:33,472 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 992 transitions. [2024-11-07 03:34:33,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-07 03:34:33,477 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:33,478 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:33,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:34:33,478 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:33,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1003772534, now seen corresponding path program 1 times [2024-11-07 03:34:33,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:33,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476297246] [2024-11-07 03:34:33,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:33,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:33,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:33,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:33,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:33,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476297246] [2024-11-07 03:34:33,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476297246] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:33,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:33,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:33,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871217299] [2024-11-07 03:34:33,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:33,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:33,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:33,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:33,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:33,916 INFO L87 Difference]: Start difference. First operand 670 states and 992 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:33,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:33,955 INFO L93 Difference]: Finished difference Result 1308 states and 1937 transitions. [2024-11-07 03:34:33,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:33,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-11-07 03:34:33,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:33,959 INFO L225 Difference]: With dead ends: 1308 [2024-11-07 03:34:33,959 INFO L226 Difference]: Without dead ends: 672 [2024-11-07 03:34:33,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:33,963 INFO L432 NwaCegarLoop]: 988 mSDtfsCounter, 0 mSDsluCounter, 1966 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2954 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-07 03:34:33,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2954 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-07 03:34:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-11-07 03:34:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 668 states have (on average 1.4820359281437125) internal successors, (990), 668 states have internal predecessors, (990), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 994 transitions. [2024-11-07 03:34:33,979 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 994 transitions. Word has length 228 [2024-11-07 03:34:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:33,980 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 994 transitions. [2024-11-07 03:34:33,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:33,981 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 994 transitions. [2024-11-07 03:34:33,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-07 03:34:33,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:33,983 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:33,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:34:33,983 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:33,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:33,984 INFO L85 PathProgramCache]: Analyzing trace with hash -45787094, now seen corresponding path program 1 times [2024-11-07 03:34:33,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:33,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403586794] [2024-11-07 03:34:33,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:33,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:34,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:34,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:34,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:34,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:34,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:34,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403586794] [2024-11-07 03:34:34,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403586794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:34,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:34,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:34,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621516571] [2024-11-07 03:34:34,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:34,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:34,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:34,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:34,471 INFO L87 Difference]: Start difference. First operand 672 states and 994 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:34,550 INFO L93 Difference]: Finished difference Result 1310 states and 1938 transitions. [2024-11-07 03:34:34,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:34,550 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 229 [2024-11-07 03:34:34,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:34,553 INFO L225 Difference]: With dead ends: 1310 [2024-11-07 03:34:34,553 INFO L226 Difference]: Without dead ends: 672 [2024-11-07 03:34:34,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-07 03:34:34,556 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 946 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1952 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:34,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 1952 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2024-11-07 03:34:34,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672. [2024-11-07 03:34:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 668 states have (on average 1.4805389221556886) internal successors, (989), 668 states have internal predecessors, (989), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 993 transitions. [2024-11-07 03:34:34,571 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 993 transitions. Word has length 229 [2024-11-07 03:34:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:34,572 INFO L471 AbstractCegarLoop]: Abstraction has 672 states and 993 transitions. [2024-11-07 03:34:34,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 993 transitions. [2024-11-07 03:34:34,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2024-11-07 03:34:34,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:34,574 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:34,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:34:34,574 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:34,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1341732974, now seen corresponding path program 1 times [2024-11-07 03:34:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724390331] [2024-11-07 03:34:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:35,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:35,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:35,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:35,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:35,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724390331] [2024-11-07 03:34:35,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724390331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:35,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:35,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:34:35,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009778527] [2024-11-07 03:34:35,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:35,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:34:35,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:35,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:34:35,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:34:35,192 INFO L87 Difference]: Start difference. First operand 672 states and 993 transitions. Second operand has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:35,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:35,294 INFO L93 Difference]: Finished difference Result 1828 states and 2704 transitions. [2024-11-07 03:34:35,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:34:35,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 230 [2024-11-07 03:34:35,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:35,299 INFO L225 Difference]: With dead ends: 1828 [2024-11-07 03:34:35,299 INFO L226 Difference]: Without dead ends: 1190 [2024-11-07 03:34:35,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-07 03:34:35,300 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 739 mSDsluCounter, 2914 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 3889 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:35,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 3889 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:35,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-07 03:34:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 710. [2024-11-07 03:34:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 704 states have (on average 1.4744318181818181) internal successors, (1038), 704 states have internal predecessors, (1038), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 03:34:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1046 transitions. [2024-11-07 03:34:35,319 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1046 transitions. Word has length 230 [2024-11-07 03:34:35,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:35,319 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1046 transitions. [2024-11-07 03:34:35,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:35,319 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1046 transitions. [2024-11-07 03:34:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 03:34:35,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:35,321 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:35,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 03:34:35,322 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:35,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:35,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1783179846, now seen corresponding path program 1 times [2024-11-07 03:34:35,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:35,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243662205] [2024-11-07 03:34:35,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:35,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:35,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:35,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:35,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:35,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:35,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:35,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243662205] [2024-11-07 03:34:35,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243662205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:35,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:35,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:35,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342057684] [2024-11-07 03:34:35,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:35,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:35,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:35,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:35,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:35,589 INFO L87 Difference]: Start difference. First operand 710 states and 1046 transitions. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:35,632 INFO L93 Difference]: Finished difference Result 1386 states and 2042 transitions. [2024-11-07 03:34:35,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:35,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-11-07 03:34:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:35,635 INFO L225 Difference]: With dead ends: 1386 [2024-11-07 03:34:35,635 INFO L226 Difference]: Without dead ends: 710 [2024-11-07 03:34:35,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:34:35,637 INFO L432 NwaCegarLoop]: 981 mSDtfsCounter, 941 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1966 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:35,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1966 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:35,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2024-11-07 03:34:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2024-11-07 03:34:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 704 states have (on average 1.4730113636363635) internal successors, (1037), 704 states have internal predecessors, (1037), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-07 03:34:35,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1045 transitions. [2024-11-07 03:34:35,651 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1045 transitions. Word has length 231 [2024-11-07 03:34:35,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:35,653 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1045 transitions. [2024-11-07 03:34:35,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:35,654 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1045 transitions. [2024-11-07 03:34:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2024-11-07 03:34:35,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:35,656 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:35,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 03:34:35,656 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:35,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:35,656 INFO L85 PathProgramCache]: Analyzing trace with hash 479885786, now seen corresponding path program 1 times [2024-11-07 03:34:35,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309086796] [2024-11-07 03:34:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:34:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:36,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:34:36,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:36,124 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:36,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:36,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309086796] [2024-11-07 03:34:36,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309086796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:36,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:36,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:36,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895703945] [2024-11-07 03:34:36,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:36,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:36,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:36,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:36,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:36,127 INFO L87 Difference]: Start difference. First operand 710 states and 1045 transitions. Second operand has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:36,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:36,277 INFO L93 Difference]: Finished difference Result 1904 states and 2807 transitions. [2024-11-07 03:34:36,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:36,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231 [2024-11-07 03:34:36,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:36,282 INFO L225 Difference]: With dead ends: 1904 [2024-11-07 03:34:36,282 INFO L226 Difference]: Without dead ends: 1228 [2024-11-07 03:34:36,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:36,285 INFO L432 NwaCegarLoop]: 1730 mSDtfsCounter, 572 mSDsluCounter, 5391 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 7121 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:36,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 7121 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:36,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-07 03:34:36,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1084. [2024-11-07 03:34:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 1076 states have (on average 1.4767657992565055) internal successors, (1589), 1076 states have internal predecessors, (1589), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 03:34:36,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1601 transitions. [2024-11-07 03:34:36,315 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1601 transitions. Word has length 231 [2024-11-07 03:34:36,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:36,316 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1601 transitions. [2024-11-07 03:34:36,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:36,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1601 transitions. [2024-11-07 03:34:36,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-07 03:34:36,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:36,320 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:36,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 03:34:36,320 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:36,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:36,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1217216623, now seen corresponding path program 1 times [2024-11-07 03:34:36,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:36,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281989403] [2024-11-07 03:34:36,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:36,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:36,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:36,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:36,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281989403] [2024-11-07 03:34:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281989403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:36,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:36,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800125009] [2024-11-07 03:34:36,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:36,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:36,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:36,918 INFO L87 Difference]: Start difference. First operand 1084 states and 1601 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:37,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:37,060 INFO L93 Difference]: Finished difference Result 2614 states and 3865 transitions. [2024-11-07 03:34:37,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:37,060 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2024-11-07 03:34:37,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:37,066 INFO L225 Difference]: With dead ends: 2614 [2024-11-07 03:34:37,066 INFO L226 Difference]: Without dead ends: 1564 [2024-11-07 03:34:37,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:37,068 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 852 mSDsluCounter, 3870 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 4837 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:37,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 4837 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-07 03:34:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1132. [2024-11-07 03:34:37,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1124 states have (on average 1.4759786476868328) internal successors, (1659), 1124 states have internal predecessors, (1659), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 03:34:37,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1671 transitions. [2024-11-07 03:34:37,106 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1671 transitions. Word has length 232 [2024-11-07 03:34:37,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:37,106 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1671 transitions. [2024-11-07 03:34:37,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1671 transitions. [2024-11-07 03:34:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-07 03:34:37,109 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:37,109 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:37,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 03:34:37,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:37,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:37,110 INFO L85 PathProgramCache]: Analyzing trace with hash -411954126, now seen corresponding path program 1 times [2024-11-07 03:34:37,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:37,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932473222] [2024-11-07 03:34:37,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:37,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:37,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:34:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:37,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:34:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:37,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:37,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:37,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932473222] [2024-11-07 03:34:37,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932473222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:37,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:37,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:37,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264727812] [2024-11-07 03:34:37,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:37,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:37,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:37,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:37,561 INFO L87 Difference]: Start difference. First operand 1132 states and 1671 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:37,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:37,704 INFO L93 Difference]: Finished difference Result 2374 states and 3502 transitions. [2024-11-07 03:34:37,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:37,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2024-11-07 03:34:37,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:37,709 INFO L225 Difference]: With dead ends: 2374 [2024-11-07 03:34:37,709 INFO L226 Difference]: Without dead ends: 1276 [2024-11-07 03:34:37,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:37,711 INFO L432 NwaCegarLoop]: 1732 mSDtfsCounter, 718 mSDsluCounter, 5397 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 7129 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:37,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 7129 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-11-07 03:34:37,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1132. [2024-11-07 03:34:37,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 1124 states have (on average 1.4750889679715302) internal successors, (1658), 1124 states have internal predecessors, (1658), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-07 03:34:37,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1670 transitions. [2024-11-07 03:34:37,739 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1670 transitions. Word has length 232 [2024-11-07 03:34:37,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:37,740 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1670 transitions. [2024-11-07 03:34:37,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:37,740 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1670 transitions. [2024-11-07 03:34:37,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-07 03:34:37,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:37,743 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:37,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 03:34:37,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:37,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash -837194283, now seen corresponding path program 1 times [2024-11-07 03:34:37,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:37,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617074606] [2024-11-07 03:34:37,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:37,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:38,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:38,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:38,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:38,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:38,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617074606] [2024-11-07 03:34:38,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617074606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:38,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:38,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:38,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466418548] [2024-11-07 03:34:38,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:38,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:38,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:38,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:38,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:38,260 INFO L87 Difference]: Start difference. First operand 1132 states and 1670 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:38,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:38,372 INFO L93 Difference]: Finished difference Result 2811 states and 4145 transitions. [2024-11-07 03:34:38,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:38,373 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232 [2024-11-07 03:34:38,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:38,380 INFO L225 Difference]: With dead ends: 2811 [2024-11-07 03:34:38,380 INFO L226 Difference]: Without dead ends: 1713 [2024-11-07 03:34:38,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:38,382 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 351 mSDsluCounter, 3890 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 4863 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:38,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 4863 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:38,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2024-11-07 03:34:38,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1539. [2024-11-07 03:34:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1525 states have (on average 1.4681967213114755) internal successors, (2239), 1525 states have internal predecessors, (2239), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 03:34:38,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2263 transitions. [2024-11-07 03:34:38,421 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2263 transitions. Word has length 232 [2024-11-07 03:34:38,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:38,421 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2263 transitions. [2024-11-07 03:34:38,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2263 transitions. [2024-11-07 03:34:38,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2024-11-07 03:34:38,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:38,425 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:38,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 03:34:38,426 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:38,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:38,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1258496230, now seen corresponding path program 1 times [2024-11-07 03:34:38,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:38,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968066500] [2024-11-07 03:34:38,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:38,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:39,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:39,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:39,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:39,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968066500] [2024-11-07 03:34:39,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968066500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:39,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:39,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:39,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758830121] [2024-11-07 03:34:39,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:39,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:39,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:39,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:39,087 INFO L87 Difference]: Start difference. First operand 1539 states and 2263 transitions. Second operand has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:39,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:39,302 INFO L93 Difference]: Finished difference Result 2849 states and 4198 transitions. [2024-11-07 03:34:39,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:39,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233 [2024-11-07 03:34:39,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:39,307 INFO L225 Difference]: With dead ends: 2849 [2024-11-07 03:34:39,307 INFO L226 Difference]: Without dead ends: 1539 [2024-11-07 03:34:39,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:39,309 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 939 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:39,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2908 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:39,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2024-11-07 03:34:39,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1539. [2024-11-07 03:34:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1525 states have (on average 1.4655737704918033) internal successors, (2235), 1525 states have internal predecessors, (2235), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 03:34:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 2259 transitions. [2024-11-07 03:34:39,334 INFO L78 Accepts]: Start accepts. Automaton has 1539 states and 2259 transitions. Word has length 233 [2024-11-07 03:34:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:39,334 INFO L471 AbstractCegarLoop]: Abstraction has 1539 states and 2259 transitions. [2024-11-07 03:34:39,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1539 states and 2259 transitions. [2024-11-07 03:34:39,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-07 03:34:39,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:39,338 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:39,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 03:34:39,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:39,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:39,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1399626630, now seen corresponding path program 1 times [2024-11-07 03:34:39,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:39,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095658212] [2024-11-07 03:34:39,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:39,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:39,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:39,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:39,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:39,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:39,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:39,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095658212] [2024-11-07 03:34:39,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095658212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:39,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703061129] [2024-11-07 03:34:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:39,795 INFO L87 Difference]: Start difference. First operand 1539 states and 2259 transitions. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:39,923 INFO L93 Difference]: Finished difference Result 3179 states and 4682 transitions. [2024-11-07 03:34:39,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:39,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234 [2024-11-07 03:34:39,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:39,930 INFO L225 Difference]: With dead ends: 3179 [2024-11-07 03:34:39,930 INFO L226 Difference]: Without dead ends: 2031 [2024-11-07 03:34:39,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:39,932 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 845 mSDsluCounter, 3869 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 4836 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:39,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 4836 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:39,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2031 states. [2024-11-07 03:34:39,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2031 to 1555. [2024-11-07 03:34:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1541 states have (on average 1.464633354964309) internal successors, (2257), 1541 states have internal predecessors, (2257), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 03:34:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 2281 transitions. [2024-11-07 03:34:39,964 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 2281 transitions. Word has length 234 [2024-11-07 03:34:39,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:39,964 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 2281 transitions. [2024-11-07 03:34:39,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 2281 transitions. [2024-11-07 03:34:39,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-07 03:34:39,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:39,968 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:39,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 03:34:39,968 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:39,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:39,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2119431718, now seen corresponding path program 1 times [2024-11-07 03:34:39,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:39,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071821864] [2024-11-07 03:34:39,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:39,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:40,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:40,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:40,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:40,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071821864] [2024-11-07 03:34:40,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071821864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:40,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:40,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:40,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588750397] [2024-11-07 03:34:40,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:40,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:40,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:40,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:40,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:40,420 INFO L87 Difference]: Start difference. First operand 1555 states and 2281 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:40,566 INFO L93 Difference]: Finished difference Result 2835 states and 4170 transitions. [2024-11-07 03:34:40,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:40,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235 [2024-11-07 03:34:40,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:40,573 INFO L225 Difference]: With dead ends: 2835 [2024-11-07 03:34:40,573 INFO L226 Difference]: Without dead ends: 1729 [2024-11-07 03:34:40,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:40,576 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 337 mSDsluCounter, 3880 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 4850 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:40,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 4850 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:40,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2024-11-07 03:34:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1587. [2024-11-07 03:34:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1573 states have (on average 1.4640813731722822) internal successors, (2303), 1573 states have internal predecessors, (2303), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 03:34:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2327 transitions. [2024-11-07 03:34:40,620 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2327 transitions. Word has length 235 [2024-11-07 03:34:40,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:40,621 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2327 transitions. [2024-11-07 03:34:40,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:40,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2327 transitions. [2024-11-07 03:34:40,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-07 03:34:40,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:40,626 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:40,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 03:34:40,627 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:40,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:40,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1837477802, now seen corresponding path program 1 times [2024-11-07 03:34:40,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:40,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695016070] [2024-11-07 03:34:40,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:40,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:41,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:34:41,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:41,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:34:41,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:41,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:41,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:41,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695016070] [2024-11-07 03:34:41,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695016070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:41,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:41,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:41,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742394663] [2024-11-07 03:34:41,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:41,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:41,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:41,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:41,166 INFO L87 Difference]: Start difference. First operand 1587 states and 2327 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:41,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:41,293 INFO L93 Difference]: Finished difference Result 3243 states and 4771 transitions. [2024-11-07 03:34:41,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:41,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235 [2024-11-07 03:34:41,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:41,300 INFO L225 Difference]: With dead ends: 3243 [2024-11-07 03:34:41,301 INFO L226 Difference]: Without dead ends: 2079 [2024-11-07 03:34:41,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:41,305 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 838 mSDsluCounter, 3872 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 838 SdHoareTripleChecker+Valid, 4840 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:41,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [838 Valid, 4840 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:41,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-07 03:34:41,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1603. [2024-11-07 03:34:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1589 states have (on average 1.4631843926998112) internal successors, (2325), 1589 states have internal predecessors, (2325), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-07 03:34:41,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2349 transitions. [2024-11-07 03:34:41,347 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2349 transitions. Word has length 235 [2024-11-07 03:34:41,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:41,347 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2349 transitions. [2024-11-07 03:34:41,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:41,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2349 transitions. [2024-11-07 03:34:41,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-11-07 03:34:41,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:41,352 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:41,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 03:34:41,352 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:41,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:41,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1944839193, now seen corresponding path program 1 times [2024-11-07 03:34:41,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:41,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960595164] [2024-11-07 03:34:41,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:41,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:41,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 03:34:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:41,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 03:34:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:41,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:41,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:41,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960595164] [2024-11-07 03:34:41,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960595164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:41,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:41,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:41,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104302889] [2024-11-07 03:34:41,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:41,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:41,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:41,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:41,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:41,743 INFO L87 Difference]: Start difference. First operand 1603 states and 2349 transitions. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:41,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:41,829 INFO L93 Difference]: Finished difference Result 3208 states and 4706 transitions. [2024-11-07 03:34:41,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:41,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235 [2024-11-07 03:34:41,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:41,837 INFO L225 Difference]: With dead ends: 3208 [2024-11-07 03:34:41,837 INFO L226 Difference]: Without dead ends: 2094 [2024-11-07 03:34:41,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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-07 03:34:41,840 INFO L432 NwaCegarLoop]: 1284 mSDtfsCounter, 191 mSDsluCounter, 4817 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 6101 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:41,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 6101 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:41,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2024-11-07 03:34:41,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2090. [2024-11-07 03:34:41,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2070 states have (on average 1.459903381642512) internal successors, (3022), 2070 states have internal predecessors, (3022), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:34:41,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 3058 transitions. [2024-11-07 03:34:41,885 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 3058 transitions. Word has length 235 [2024-11-07 03:34:41,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:41,886 INFO L471 AbstractCegarLoop]: Abstraction has 2090 states and 3058 transitions. [2024-11-07 03:34:41,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:41,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3058 transitions. [2024-11-07 03:34:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-07 03:34:41,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:41,890 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:41,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 03:34:41,890 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1097587510, now seen corresponding path program 1 times [2024-11-07 03:34:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356093298] [2024-11-07 03:34:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:42,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:42,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:42,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:42,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:42,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356093298] [2024-11-07 03:34:42,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356093298] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:42,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:42,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:34:42,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735717382] [2024-11-07 03:34:42,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:42,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:34:42,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:42,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:34:42,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:42,532 INFO L87 Difference]: Start difference. First operand 2090 states and 3058 transitions. Second operand has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:42,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:42,838 INFO L93 Difference]: Finished difference Result 3532 states and 5184 transitions. [2024-11-07 03:34:42,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:42,840 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 236 [2024-11-07 03:34:42,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:42,846 INFO L225 Difference]: With dead ends: 3532 [2024-11-07 03:34:42,846 INFO L226 Difference]: Without dead ends: 2090 [2024-11-07 03:34:42,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:42,849 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1050 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 3643 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:42,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 3643 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2024-11-07 03:34:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2024-11-07 03:34:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2070 states have (on average 1.4570048309178745) internal successors, (3016), 2070 states have internal predecessors, (3016), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:34:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 3052 transitions. [2024-11-07 03:34:42,891 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 3052 transitions. Word has length 236 [2024-11-07 03:34:42,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:42,891 INFO L471 AbstractCegarLoop]: Abstraction has 2090 states and 3052 transitions. [2024-11-07 03:34:42,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:42,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 3052 transitions. [2024-11-07 03:34:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-07 03:34:42,895 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:42,895 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:42,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 03:34:42,896 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:42,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash -780010773, now seen corresponding path program 1 times [2024-11-07 03:34:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889659108] [2024-11-07 03:34:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:43,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:43,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:43,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:43,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:43,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889659108] [2024-11-07 03:34:43,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889659108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:43,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:43,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:43,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614693215] [2024-11-07 03:34:43,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:43,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:43,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:43,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:43,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:43,294 INFO L87 Difference]: Start difference. First operand 2090 states and 3052 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:43,429 INFO L93 Difference]: Finished difference Result 3872 states and 5680 transitions. [2024-11-07 03:34:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:43,429 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237 [2024-11-07 03:34:43,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:43,437 INFO L225 Difference]: With dead ends: 3872 [2024-11-07 03:34:43,437 INFO L226 Difference]: Without dead ends: 2642 [2024-11-07 03:34:43,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:43,439 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 831 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 4835 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:43,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 4835 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:43,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2642 states. [2024-11-07 03:34:43,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2642 to 2114. [2024-11-07 03:34:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2114 states, 2094 states have (on average 1.4560649474689589) internal successors, (3049), 2094 states have internal predecessors, (3049), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:34:43,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 3085 transitions. [2024-11-07 03:34:43,480 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 3085 transitions. Word has length 237 [2024-11-07 03:34:43,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:43,481 INFO L471 AbstractCegarLoop]: Abstraction has 2114 states and 3085 transitions. [2024-11-07 03:34:43,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:43,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 3085 transitions. [2024-11-07 03:34:43,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-07 03:34:43,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:43,485 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:43,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 03:34:43,485 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:43,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:43,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1096949590, now seen corresponding path program 1 times [2024-11-07 03:34:43,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:43,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644365897] [2024-11-07 03:34:43,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:43,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:43,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:43,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:43,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644365897] [2024-11-07 03:34:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644365897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488106173] [2024-11-07 03:34:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:43,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:43,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:43,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:43,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:43,859 INFO L87 Difference]: Start difference. First operand 2114 states and 3085 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:43,964 INFO L93 Difference]: Finished difference Result 3378 states and 4946 transitions. [2024-11-07 03:34:43,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:43,965 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237 [2024-11-07 03:34:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:43,971 INFO L225 Difference]: With dead ends: 3378 [2024-11-07 03:34:43,971 INFO L226 Difference]: Without dead ends: 2256 [2024-11-07 03:34:43,973 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:43,973 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 328 mSDsluCounter, 3876 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 4845 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:43,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 4845 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:43,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2256 states. [2024-11-07 03:34:44,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2256 to 2130. [2024-11-07 03:34:44,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2130 states, 2110 states have (on average 1.4554502369668247) internal successors, (3071), 2110 states have internal predecessors, (3071), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:34:44,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 3107 transitions. [2024-11-07 03:34:44,014 INFO L78 Accepts]: Start accepts. Automaton has 2130 states and 3107 transitions. Word has length 237 [2024-11-07 03:34:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:44,014 INFO L471 AbstractCegarLoop]: Abstraction has 2130 states and 3107 transitions. [2024-11-07 03:34:44,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:44,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2130 states and 3107 transitions. [2024-11-07 03:34:44,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-07 03:34:44,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:44,019 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:44,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 03:34:44,019 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:44,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 465727942, now seen corresponding path program 1 times [2024-11-07 03:34:44,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:44,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969708349] [2024-11-07 03:34:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:44,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:44,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 03:34:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:44,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 03:34:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:44,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:44,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969708349] [2024-11-07 03:34:44,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969708349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:44,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:44,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:44,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730988199] [2024-11-07 03:34:44,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:44,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:44,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:44,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:44,409 INFO L87 Difference]: Start difference. First operand 2130 states and 3107 transitions. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:44,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:44,493 INFO L93 Difference]: Finished difference Result 3260 states and 4768 transitions. [2024-11-07 03:34:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237 [2024-11-07 03:34:44,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:44,501 INFO L225 Difference]: With dead ends: 3260 [2024-11-07 03:34:44,501 INFO L226 Difference]: Without dead ends: 2138 [2024-11-07 03:34:44,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:44,504 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 861 mSDsluCounter, 2910 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:44,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 3884 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:44,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2024-11-07 03:34:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 2134. [2024-11-07 03:34:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 2114 states have (on average 1.4545884578997161) internal successors, (3075), 2114 states have internal predecessors, (3075), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 03:34:44,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 3111 transitions. [2024-11-07 03:34:44,545 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 3111 transitions. Word has length 237 [2024-11-07 03:34:44,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:44,545 INFO L471 AbstractCegarLoop]: Abstraction has 2134 states and 3111 transitions. [2024-11-07 03:34:44,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:44,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 3111 transitions. [2024-11-07 03:34:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-07 03:34:44,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:44,550 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:44,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 03:34:44,550 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:44,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:44,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1397956299, now seen corresponding path program 1 times [2024-11-07 03:34:44,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:44,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574609520] [2024-11-07 03:34:44,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:44,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:45,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:34:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:45,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:34:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:45,135 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:45,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:45,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574609520] [2024-11-07 03:34:45,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574609520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:45,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:45,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:34:45,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480426960] [2024-11-07 03:34:45,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:45,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:34:45,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:45,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:34:45,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:45,137 INFO L87 Difference]: Start difference. First operand 2134 states and 3111 transitions. Second operand has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:45,492 INFO L93 Difference]: Finished difference Result 3904 states and 5703 transitions. [2024-11-07 03:34:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:34:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237 [2024-11-07 03:34:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:45,499 INFO L225 Difference]: With dead ends: 3904 [2024-11-07 03:34:45,499 INFO L226 Difference]: Without dead ends: 2718 [2024-11-07 03:34:45,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:45,504 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 1428 mSDsluCounter, 3560 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1430 SdHoareTripleChecker+Valid, 4462 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:45,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1430 Valid, 4462 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:34:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2718 states. [2024-11-07 03:34:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2718 to 2540. [2024-11-07 03:34:45,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 2514 states have (on average 1.4502784407319014) internal successors, (3646), 2514 states have internal predecessors, (3646), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:45,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3694 transitions. [2024-11-07 03:34:45,565 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3694 transitions. Word has length 237 [2024-11-07 03:34:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:45,566 INFO L471 AbstractCegarLoop]: Abstraction has 2540 states and 3694 transitions. [2024-11-07 03:34:45,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3694 transitions. [2024-11-07 03:34:45,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-07 03:34:45,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:45,572 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:45,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 03:34:45,572 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:45,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:45,572 INFO L85 PathProgramCache]: Analyzing trace with hash 2078366875, now seen corresponding path program 1 times [2024-11-07 03:34:45,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:45,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771119369] [2024-11-07 03:34:45,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:45,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:45,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:45,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:45,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:45,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771119369] [2024-11-07 03:34:45,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771119369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:45,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:45,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:45,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810678714] [2024-11-07 03:34:45,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:45,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:45,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:45,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:45,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:45,993 INFO L87 Difference]: Start difference. First operand 2540 states and 3694 transitions. Second operand has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:46,089 INFO L93 Difference]: Finished difference Result 3796 states and 5539 transitions. [2024-11-07 03:34:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 238 [2024-11-07 03:34:46,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:46,098 INFO L225 Difference]: With dead ends: 3796 [2024-11-07 03:34:46,098 INFO L226 Difference]: Without dead ends: 2670 [2024-11-07 03:34:46,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:46,101 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 318 mSDsluCounter, 3873 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 4842 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:46,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 4842 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:46,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2670 states. [2024-11-07 03:34:46,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2670 to 2576. [2024-11-07 03:34:46,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2576 states, 2550 states have (on average 1.4494117647058824) internal successors, (3696), 2550 states have internal predecessors, (3696), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2576 states to 2576 states and 3744 transitions. [2024-11-07 03:34:46,143 INFO L78 Accepts]: Start accepts. Automaton has 2576 states and 3744 transitions. Word has length 238 [2024-11-07 03:34:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:46,144 INFO L471 AbstractCegarLoop]: Abstraction has 2576 states and 3744 transitions. [2024-11-07 03:34:46,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.5) internal successors, (231), 6 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 2576 states and 3744 transitions. [2024-11-07 03:34:46,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-07 03:34:46,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:46,149 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:46,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 03:34:46,149 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:46,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1054742918, now seen corresponding path program 1 times [2024-11-07 03:34:46,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:46,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651931578] [2024-11-07 03:34:46,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:46,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:34:46,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:46,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:34:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651931578] [2024-11-07 03:34:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651931578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:34:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975619219] [2024-11-07 03:34:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:46,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:34:46,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:46,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:34:46,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:46,686 INFO L87 Difference]: Start difference. First operand 2576 states and 3744 transitions. Second operand has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:46,998 INFO L93 Difference]: Finished difference Result 3908 states and 5701 transitions. [2024-11-07 03:34:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:34:46,998 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 238 [2024-11-07 03:34:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:47,003 INFO L225 Difference]: With dead ends: 3908 [2024-11-07 03:34:47,004 INFO L226 Difference]: Without dead ends: 2754 [2024-11-07 03:34:47,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:47,007 INFO L432 NwaCegarLoop]: 902 mSDtfsCounter, 1353 mSDsluCounter, 3572 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1355 SdHoareTripleChecker+Valid, 4474 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:47,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1355 Valid, 4474 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:34:47,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2754 states. [2024-11-07 03:34:47,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2754 to 2608. [2024-11-07 03:34:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2608 states, 2582 states have (on average 1.4484895429899303) internal successors, (3740), 2582 states have internal predecessors, (3740), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2608 states to 2608 states and 3788 transitions. [2024-11-07 03:34:47,053 INFO L78 Accepts]: Start accepts. Automaton has 2608 states and 3788 transitions. Word has length 238 [2024-11-07 03:34:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:47,054 INFO L471 AbstractCegarLoop]: Abstraction has 2608 states and 3788 transitions. [2024-11-07 03:34:47,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2608 states and 3788 transitions. [2024-11-07 03:34:47,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 03:34:47,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:47,058 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:47,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 03:34:47,058 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:47,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:47,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1600264102, now seen corresponding path program 1 times [2024-11-07 03:34:47,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:47,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677908008] [2024-11-07 03:34:47,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:47,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:47,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:47,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:47,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:47,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677908008] [2024-11-07 03:34:47,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677908008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:47,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:47,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779958642] [2024-11-07 03:34:47,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:47,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:47,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:47,481 INFO L87 Difference]: Start difference. First operand 2608 states and 3788 transitions. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:47,577 INFO L93 Difference]: Finished difference Result 3828 states and 5581 transitions. [2024-11-07 03:34:47,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:47,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239 [2024-11-07 03:34:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:47,582 INFO L225 Difference]: With dead ends: 3828 [2024-11-07 03:34:47,583 INFO L226 Difference]: Without dead ends: 2702 [2024-11-07 03:34:47,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:47,586 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 312 mSDsluCounter, 3873 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 4842 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:47,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 4842 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2024-11-07 03:34:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2624. [2024-11-07 03:34:47,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2624 states, 2598 states have (on average 1.4480369515011546) internal successors, (3762), 2598 states have internal predecessors, (3762), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3810 transitions. [2024-11-07 03:34:47,623 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3810 transitions. Word has length 239 [2024-11-07 03:34:47,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:47,623 INFO L471 AbstractCegarLoop]: Abstraction has 2624 states and 3810 transitions. [2024-11-07 03:34:47,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3810 transitions. [2024-11-07 03:34:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2024-11-07 03:34:47,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:47,629 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:47,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 03:34:47,629 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:47,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:47,630 INFO L85 PathProgramCache]: Analyzing trace with hash 807835065, now seen corresponding path program 1 times [2024-11-07 03:34:47,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:47,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178810546] [2024-11-07 03:34:47,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:47,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:48,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:34:48,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:48,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:34:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:48,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:48,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178810546] [2024-11-07 03:34:48,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178810546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:48,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:48,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 03:34:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800829708] [2024-11-07 03:34:48,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:48,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:34:48,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:48,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:34:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:48,401 INFO L87 Difference]: Start difference. First operand 2624 states and 3810 transitions. Second operand has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:48,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:48,621 INFO L93 Difference]: Finished difference Result 3996 states and 5831 transitions. [2024-11-07 03:34:48,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:48,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239 [2024-11-07 03:34:48,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:48,628 INFO L225 Difference]: With dead ends: 3996 [2024-11-07 03:34:48,628 INFO L226 Difference]: Without dead ends: 2870 [2024-11-07 03:34:48,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:48,631 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 1776 mSDsluCounter, 2888 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 3800 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:48,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1776 Valid, 3800 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:48,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2870 states. [2024-11-07 03:34:48,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2870 to 2868. [2024-11-07 03:34:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2868 states, 2842 states have (on average 1.4517945109078114) internal successors, (4126), 2842 states have internal predecessors, (4126), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2868 states to 2868 states and 4174 transitions. [2024-11-07 03:34:48,675 INFO L78 Accepts]: Start accepts. Automaton has 2868 states and 4174 transitions. Word has length 239 [2024-11-07 03:34:48,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:48,676 INFO L471 AbstractCegarLoop]: Abstraction has 2868 states and 4174 transitions. [2024-11-07 03:34:48,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 29.0) internal successors, (232), 8 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:48,676 INFO L276 IsEmpty]: Start isEmpty. Operand 2868 states and 4174 transitions. [2024-11-07 03:34:48,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2024-11-07 03:34:48,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:48,680 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:48,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 03:34:48,681 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:48,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:48,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1309709050, now seen corresponding path program 1 times [2024-11-07 03:34:48,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:48,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487259568] [2024-11-07 03:34:48,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:48,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:34:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:49,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:34:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:49,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:49,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:49,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487259568] [2024-11-07 03:34:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487259568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:49,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:49,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:34:49,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498196940] [2024-11-07 03:34:49,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:49,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:34:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:49,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:34:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:34:49,490 INFO L87 Difference]: Start difference. First operand 2868 states and 4174 transitions. Second operand has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:50,000 INFO L93 Difference]: Finished difference Result 4860 states and 7093 transitions. [2024-11-07 03:34:50,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 03:34:50,001 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 240 [2024-11-07 03:34:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:50,010 INFO L225 Difference]: With dead ends: 4860 [2024-11-07 03:34:50,010 INFO L226 Difference]: Without dead ends: 2916 [2024-11-07 03:34:50,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-07 03:34:50,016 INFO L432 NwaCegarLoop]: 912 mSDtfsCounter, 2556 mSDsluCounter, 4895 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 5807 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:50,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 5807 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:34:50,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2916 states. [2024-11-07 03:34:50,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2916 to 2892. [2024-11-07 03:34:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2866 states have (on average 1.4480111653872993) internal successors, (4150), 2866 states have internal predecessors, (4150), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 4198 transitions. [2024-11-07 03:34:50,071 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 4198 transitions. Word has length 240 [2024-11-07 03:34:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:50,071 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 4198 transitions. [2024-11-07 03:34:50,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.181818181818183) internal successors, (233), 11 states have internal predecessors, (233), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:50,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 4198 transitions. [2024-11-07 03:34:50,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-11-07 03:34:50,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:50,077 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:50,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 03:34:50,078 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:50,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:50,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1341622951, now seen corresponding path program 1 times [2024-11-07 03:34:50,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:50,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780084092] [2024-11-07 03:34:50,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:50,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:50,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:34:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:50,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:34:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:50,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:50,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:50,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780084092] [2024-11-07 03:34:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780084092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:50,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:34:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622817491] [2024-11-07 03:34:50,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:50,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:34:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:34:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:50,698 INFO L87 Difference]: Start difference. First operand 2892 states and 4198 transitions. Second operand has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:51,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:51,046 INFO L93 Difference]: Finished difference Result 4426 states and 6453 transitions. [2024-11-07 03:34:51,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:34:51,047 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 241 [2024-11-07 03:34:51,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:51,052 INFO L225 Difference]: With dead ends: 4426 [2024-11-07 03:34:51,052 INFO L226 Difference]: Without dead ends: 3038 [2024-11-07 03:34:51,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-07 03:34:51,055 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 1847 mSDsluCounter, 5469 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1849 SdHoareTripleChecker+Valid, 6405 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:51,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1849 Valid, 6405 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:34:51,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2024-11-07 03:34:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2908. [2024-11-07 03:34:51,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2882 states have (on average 1.446911866759195) internal successors, (4170), 2882 states have internal predecessors, (4170), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:51,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4218 transitions. [2024-11-07 03:34:51,089 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4218 transitions. Word has length 241 [2024-11-07 03:34:51,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:51,090 INFO L471 AbstractCegarLoop]: Abstraction has 2908 states and 4218 transitions. [2024-11-07 03:34:51,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.0) internal successors, (234), 9 states have internal predecessors, (234), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:51,090 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4218 transitions. [2024-11-07 03:34:51,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2024-11-07 03:34:51,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:51,094 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:51,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 03:34:51,094 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:51,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:51,094 INFO L85 PathProgramCache]: Analyzing trace with hash -304701537, now seen corresponding path program 1 times [2024-11-07 03:34:51,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:51,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316766154] [2024-11-07 03:34:51,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:51,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:51,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:51,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:51,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:51,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:51,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316766154] [2024-11-07 03:34:51,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316766154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:51,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:51,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:34:51,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284372036] [2024-11-07 03:34:51,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:51,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:34:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:51,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:34:51,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:51,599 INFO L87 Difference]: Start difference. First operand 2908 states and 4218 transitions. Second operand has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:51,816 INFO L93 Difference]: Finished difference Result 4796 states and 6983 transitions. [2024-11-07 03:34:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 242 [2024-11-07 03:34:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:51,821 INFO L225 Difference]: With dead ends: 4796 [2024-11-07 03:34:51,822 INFO L226 Difference]: Without dead ends: 2908 [2024-11-07 03:34:51,824 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:51,825 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 1638 mSDsluCounter, 1975 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1638 SdHoareTripleChecker+Valid, 2872 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:51,825 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1638 Valid, 2872 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2908 states. [2024-11-07 03:34:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2908 to 2908. [2024-11-07 03:34:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2908 states, 2882 states have (on average 1.4441360166551007) internal successors, (4162), 2882 states have internal predecessors, (4162), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2908 states to 2908 states and 4210 transitions. [2024-11-07 03:34:51,865 INFO L78 Accepts]: Start accepts. Automaton has 2908 states and 4210 transitions. Word has length 242 [2024-11-07 03:34:51,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:51,865 INFO L471 AbstractCegarLoop]: Abstraction has 2908 states and 4210 transitions. [2024-11-07 03:34:51,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.57142857142857) internal successors, (235), 7 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2908 states and 4210 transitions. [2024-11-07 03:34:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-07 03:34:51,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:51,870 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:51,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 03:34:51,870 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:51,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:51,870 INFO L85 PathProgramCache]: Analyzing trace with hash -207444364, now seen corresponding path program 1 times [2024-11-07 03:34:51,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:51,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050110037] [2024-11-07 03:34:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:51,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:52,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:52,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050110037] [2024-11-07 03:34:52,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050110037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:52,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:52,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:34:52,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388680177] [2024-11-07 03:34:52,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:52,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:34:52,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:52,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:34:52,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:34:52,119 INFO L87 Difference]: Start difference. First operand 2908 states and 4210 transitions. Second operand has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:52,167 INFO L93 Difference]: Finished difference Result 4886 states and 7090 transitions. [2024-11-07 03:34:52,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:34:52,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 243 [2024-11-07 03:34:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:52,172 INFO L225 Difference]: With dead ends: 4886 [2024-11-07 03:34:52,173 INFO L226 Difference]: Without dead ends: 2956 [2024-11-07 03:34:52,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:34:52,176 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 2 mSDsluCounter, 2924 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3902 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:52,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3902 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:52,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2024-11-07 03:34:52,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2944. [2024-11-07 03:34:52,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2944 states, 2918 states have (on average 1.4386566141192598) internal successors, (4198), 2918 states have internal predecessors, (4198), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:52,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4246 transitions. [2024-11-07 03:34:52,214 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4246 transitions. Word has length 243 [2024-11-07 03:34:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:52,215 INFO L471 AbstractCegarLoop]: Abstraction has 2944 states and 4246 transitions. [2024-11-07 03:34:52,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4246 transitions. [2024-11-07 03:34:52,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2024-11-07 03:34:52,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:52,219 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:52,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 03:34:52,219 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1223972624, now seen corresponding path program 1 times [2024-11-07 03:34:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319655086] [2024-11-07 03:34:52,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:52,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:52,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:52,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:52,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:52,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319655086] [2024-11-07 03:34:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319655086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:52,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:52,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:52,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879523093] [2024-11-07 03:34:52,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:52,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:52,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:52,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:52,636 INFO L87 Difference]: Start difference. First operand 2944 states and 4246 transitions. Second operand has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:52,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:52,677 INFO L93 Difference]: Finished difference Result 5027 states and 7258 transitions. [2024-11-07 03:34:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:52,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 243 [2024-11-07 03:34:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:52,691 INFO L225 Difference]: With dead ends: 5027 [2024-11-07 03:34:52,691 INFO L226 Difference]: Without dead ends: 2980 [2024-11-07 03:34:52,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:52,700 INFO L432 NwaCegarLoop]: 982 mSDtfsCounter, 0 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2938 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:52,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2938 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2024-11-07 03:34:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2980. [2024-11-07 03:34:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2980 states, 2954 states have (on average 1.4333107650643195) internal successors, (4234), 2954 states have internal predecessors, (4234), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:52,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2980 states to 2980 states and 4282 transitions. [2024-11-07 03:34:52,736 INFO L78 Accepts]: Start accepts. Automaton has 2980 states and 4282 transitions. Word has length 243 [2024-11-07 03:34:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:52,737 INFO L471 AbstractCegarLoop]: Abstraction has 2980 states and 4282 transitions. [2024-11-07 03:34:52,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.0) internal successors, (236), 4 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:52,737 INFO L276 IsEmpty]: Start isEmpty. Operand 2980 states and 4282 transitions. [2024-11-07 03:34:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-07 03:34:52,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:52,741 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:52,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 03:34:52,741 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:52,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:52,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1064758627, now seen corresponding path program 1 times [2024-11-07 03:34:52,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:52,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353108878] [2024-11-07 03:34:52,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:52,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:53,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:53,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:53,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:53,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353108878] [2024-11-07 03:34:53,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353108878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:53,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:53,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:34:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705718478] [2024-11-07 03:34:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:53,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:34:53,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:53,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:34:53,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:53,382 INFO L87 Difference]: Start difference. First operand 2980 states and 4282 transitions. Second operand has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:53,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:53,609 INFO L93 Difference]: Finished difference Result 5380 states and 7790 transitions. [2024-11-07 03:34:53,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:34:53,609 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2024-11-07 03:34:53,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:53,615 INFO L225 Difference]: With dead ends: 5380 [2024-11-07 03:34:53,616 INFO L226 Difference]: Without dead ends: 3742 [2024-11-07 03:34:53,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:34:53,620 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 1806 mSDsluCounter, 5739 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 6697 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:53,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 6697 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:53,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2024-11-07 03:34:53,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2988. [2024-11-07 03:34:53,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2988 states, 2962 states have (on average 1.4321404456448346) internal successors, (4242), 2962 states have internal predecessors, (4242), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:53,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 4290 transitions. [2024-11-07 03:34:53,679 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 4290 transitions. Word has length 244 [2024-11-07 03:34:53,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:53,679 INFO L471 AbstractCegarLoop]: Abstraction has 2988 states and 4290 transitions. [2024-11-07 03:34:53,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.333333333333332) internal successors, (237), 9 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 4290 transitions. [2024-11-07 03:34:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-07 03:34:53,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:53,684 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:53,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 03:34:53,685 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:53,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:53,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1491432811, now seen corresponding path program 1 times [2024-11-07 03:34:53,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:53,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618842380] [2024-11-07 03:34:53,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:53,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:54,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:54,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:54,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:54,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:54,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:54,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618842380] [2024-11-07 03:34:54,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618842380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:54,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:54,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:54,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531608135] [2024-11-07 03:34:54,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:54,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:54,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:54,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:54,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:54,177 INFO L87 Difference]: Start difference. First operand 2988 states and 4290 transitions. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:54,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:54,283 INFO L93 Difference]: Finished difference Result 5314 states and 7692 transitions. [2024-11-07 03:34:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:54,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2024-11-07 03:34:54,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:54,290 INFO L225 Difference]: With dead ends: 5314 [2024-11-07 03:34:54,290 INFO L226 Difference]: Without dead ends: 3734 [2024-11-07 03:34:54,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:54,293 INFO L432 NwaCegarLoop]: 969 mSDtfsCounter, 822 mSDsluCounter, 3873 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 4842 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:54,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 4842 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:54,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2024-11-07 03:34:54,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3020. [2024-11-07 03:34:54,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2994 states have (on average 1.4315297261189044) internal successors, (4286), 2994 states have internal predecessors, (4286), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:54,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4334 transitions. [2024-11-07 03:34:54,333 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 4334 transitions. Word has length 244 [2024-11-07 03:34:54,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:54,333 INFO L471 AbstractCegarLoop]: Abstraction has 3020 states and 4334 transitions. [2024-11-07 03:34:54,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 4334 transitions. [2024-11-07 03:34:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2024-11-07 03:34:54,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:54,337 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:54,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 03:34:54,337 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:54,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:54,338 INFO L85 PathProgramCache]: Analyzing trace with hash 888515508, now seen corresponding path program 1 times [2024-11-07 03:34:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:54,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621223923] [2024-11-07 03:34:54,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:54,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:54,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:54,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621223923] [2024-11-07 03:34:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621223923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:34:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725465198] [2024-11-07 03:34:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:54,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:34:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:34:54,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:34:54,858 INFO L87 Difference]: Start difference. First operand 3020 states and 4334 transitions. Second operand has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:55,099 INFO L93 Difference]: Finished difference Result 4888 states and 7056 transitions. [2024-11-07 03:34:55,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:55,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244 [2024-11-07 03:34:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:55,104 INFO L225 Difference]: With dead ends: 4888 [2024-11-07 03:34:55,104 INFO L226 Difference]: Without dead ends: 3020 [2024-11-07 03:34:55,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:55,107 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 1629 mSDsluCounter, 2741 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1629 SdHoareTripleChecker+Valid, 3637 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:55,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1629 Valid, 3637 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:55,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3020 states. [2024-11-07 03:34:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3020 to 3020. [2024-11-07 03:34:55,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3020 states, 2994 states have (on average 1.4288577154308617) internal successors, (4278), 2994 states have internal predecessors, (4278), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4326 transitions. [2024-11-07 03:34:55,140 INFO L78 Accepts]: Start accepts. Automaton has 3020 states and 4326 transitions. Word has length 244 [2024-11-07 03:34:55,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:55,140 INFO L471 AbstractCegarLoop]: Abstraction has 3020 states and 4326 transitions. [2024-11-07 03:34:55,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:55,140 INFO L276 IsEmpty]: Start isEmpty. Operand 3020 states and 4326 transitions. [2024-11-07 03:34:55,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-07 03:34:55,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:55,143 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:55,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 03:34:55,143 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:55,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:55,144 INFO L85 PathProgramCache]: Analyzing trace with hash -566966807, now seen corresponding path program 1 times [2024-11-07 03:34:55,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:55,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499505782] [2024-11-07 03:34:55,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:55,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:55,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:55,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:34:55,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:34:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:55,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:55,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499505782] [2024-11-07 03:34:55,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499505782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:55,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:55,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:55,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451282356] [2024-11-07 03:34:55,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:55,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:55,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:55,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:55,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:55,490 INFO L87 Difference]: Start difference. First operand 3020 states and 4326 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:55,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:55,599 INFO L93 Difference]: Finished difference Result 5298 states and 7653 transitions. [2024-11-07 03:34:55,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:34:55,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245 [2024-11-07 03:34:55,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:55,606 INFO L225 Difference]: With dead ends: 5298 [2024-11-07 03:34:55,606 INFO L226 Difference]: Without dead ends: 3734 [2024-11-07 03:34:55,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:55,609 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 815 mSDsluCounter, 3869 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 4837 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:55,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 4837 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3734 states. [2024-11-07 03:34:55,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3052. [2024-11-07 03:34:55,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3052 states, 3026 states have (on average 1.4282881692002645) internal successors, (4322), 3026 states have internal predecessors, (4322), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:55,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3052 states to 3052 states and 4370 transitions. [2024-11-07 03:34:55,644 INFO L78 Accepts]: Start accepts. Automaton has 3052 states and 4370 transitions. Word has length 245 [2024-11-07 03:34:55,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:55,644 INFO L471 AbstractCegarLoop]: Abstraction has 3052 states and 4370 transitions. [2024-11-07 03:34:55,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3052 states and 4370 transitions. [2024-11-07 03:34:55,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-07 03:34:55,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:55,648 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:55,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 03:34:55,649 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:55,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:55,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1692822620, now seen corresponding path program 1 times [2024-11-07 03:34:55,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:55,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24266374] [2024-11-07 03:34:55,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:55,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:56,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:56,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:56,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:56,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24266374] [2024-11-07 03:34:56,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24266374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:56,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:56,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:34:56,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62894348] [2024-11-07 03:34:56,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:56,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:34:56,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:56,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:34:56,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:34:56,130 INFO L87 Difference]: Start difference. First operand 3052 states and 4370 transitions. Second operand has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:56,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:56,230 INFO L93 Difference]: Finished difference Result 4542 states and 6547 transitions. [2024-11-07 03:34:56,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:34:56,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245 [2024-11-07 03:34:56,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:56,237 INFO L225 Difference]: With dead ends: 4542 [2024-11-07 03:34:56,237 INFO L226 Difference]: Without dead ends: 3130 [2024-11-07 03:34:56,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:34:56,241 INFO L432 NwaCegarLoop]: 970 mSDtfsCounter, 300 mSDsluCounter, 3874 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 4844 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:56,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 4844 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-11-07 03:34:56,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3068. [2024-11-07 03:34:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3042 states have (on average 1.428007889546351) internal successors, (4344), 3042 states have internal predecessors, (4344), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4392 transitions. [2024-11-07 03:34:56,291 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4392 transitions. Word has length 245 [2024-11-07 03:34:56,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:56,292 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4392 transitions. [2024-11-07 03:34:56,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:56,292 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4392 transitions. [2024-11-07 03:34:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-07 03:34:56,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:56,296 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:56,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 03:34:56,297 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:56,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash -321061551, now seen corresponding path program 1 times [2024-11-07 03:34:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906938906] [2024-11-07 03:34:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:56,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:34:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:56,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:34:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:56,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:56,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906938906] [2024-11-07 03:34:56,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906938906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:56,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:56,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:34:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906622592] [2024-11-07 03:34:56,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:56,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:34:56,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:34:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:56,890 INFO L87 Difference]: Start difference. First operand 3068 states and 4392 transitions. Second operand has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:57,174 INFO L93 Difference]: Finished difference Result 4912 states and 7073 transitions. [2024-11-07 03:34:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:34:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 245 [2024-11-07 03:34:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:57,178 INFO L225 Difference]: With dead ends: 4912 [2024-11-07 03:34:57,179 INFO L226 Difference]: Without dead ends: 3068 [2024-11-07 03:34:57,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:34:57,181 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 2506 mSDsluCounter, 3905 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2506 SdHoareTripleChecker+Valid, 4825 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:57,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2506 Valid, 4825 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2024-11-07 03:34:57,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 3068. [2024-11-07 03:34:57,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3068 states, 3042 states have (on average 1.4253780407626562) internal successors, (4336), 3042 states have internal predecessors, (4336), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:57,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3068 states to 3068 states and 4384 transitions. [2024-11-07 03:34:57,210 INFO L78 Accepts]: Start accepts. Automaton has 3068 states and 4384 transitions. Word has length 245 [2024-11-07 03:34:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:57,210 INFO L471 AbstractCegarLoop]: Abstraction has 3068 states and 4384 transitions. [2024-11-07 03:34:57,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.444444444444443) internal successors, (238), 9 states have internal predecessors, (238), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 3068 states and 4384 transitions. [2024-11-07 03:34:57,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-07 03:34:57,213 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:57,213 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:57,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-07 03:34:57,213 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:57,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash -709920212, now seen corresponding path program 1 times [2024-11-07 03:34:57,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:57,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854724403] [2024-11-07 03:34:57,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:57,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:57,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:57,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:57,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:57,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:57,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:57,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:57,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854724403] [2024-11-07 03:34:57,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854724403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:57,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:57,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:34:57,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317666070] [2024-11-07 03:34:57,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:57,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:34:57,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:57,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:34:57,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:57,756 INFO L87 Difference]: Start difference. First operand 3068 states and 4384 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:57,979 INFO L93 Difference]: Finished difference Result 5414 states and 7799 transitions. [2024-11-07 03:34:57,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:34:57,979 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 246 [2024-11-07 03:34:57,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:57,985 INFO L225 Difference]: With dead ends: 5414 [2024-11-07 03:34:57,985 INFO L226 Difference]: Without dead ends: 3774 [2024-11-07 03:34:57,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:34:57,989 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 1794 mSDsluCounter, 4893 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1796 SdHoareTripleChecker+Valid, 5850 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:57,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1796 Valid, 5850 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:34:57,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3774 states. [2024-11-07 03:34:58,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3774 to 3076. [2024-11-07 03:34:58,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 3050 states have (on average 1.4242622950819672) internal successors, (4344), 3050 states have internal predecessors, (4344), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4392 transitions. [2024-11-07 03:34:58,024 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4392 transitions. Word has length 246 [2024-11-07 03:34:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:58,024 INFO L471 AbstractCegarLoop]: Abstraction has 3076 states and 4392 transitions. [2024-11-07 03:34:58,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4392 transitions. [2024-11-07 03:34:58,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-07 03:34:58,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:58,029 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:58,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 03:34:58,029 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:58,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:58,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277685, now seen corresponding path program 1 times [2024-11-07 03:34:58,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:58,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154216350] [2024-11-07 03:34:58,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:58,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:58,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:34:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:58,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:34:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:58,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:58,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154216350] [2024-11-07 03:34:58,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154216350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:58,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:58,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:34:58,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272357511] [2024-11-07 03:34:58,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:58,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:34:58,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:58,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:34:58,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:34:58,562 INFO L87 Difference]: Start difference. First operand 3076 states and 4392 transitions. Second operand has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:58,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:58,830 INFO L93 Difference]: Finished difference Result 4874 states and 7001 transitions. [2024-11-07 03:34:58,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:34:58,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 246 [2024-11-07 03:34:58,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:58,835 INFO L225 Difference]: With dead ends: 4874 [2024-11-07 03:34:58,835 INFO L226 Difference]: Without dead ends: 3076 [2024-11-07 03:34:58,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:34:58,838 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 1752 mSDsluCounter, 3908 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 4827 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:58,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 4827 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:34:58,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3076 states. [2024-11-07 03:34:58,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3076 to 3076. [2024-11-07 03:34:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3076 states, 3050 states have (on average 1.421639344262295) internal successors, (4336), 3050 states have internal predecessors, (4336), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:58,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3076 states to 3076 states and 4384 transitions. [2024-11-07 03:34:58,874 INFO L78 Accepts]: Start accepts. Automaton has 3076 states and 4384 transitions. Word has length 246 [2024-11-07 03:34:58,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:58,874 INFO L471 AbstractCegarLoop]: Abstraction has 3076 states and 4384 transitions. [2024-11-07 03:34:58,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 26.555555555555557) internal successors, (239), 9 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:34:58,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3076 states and 4384 transitions. [2024-11-07 03:34:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 03:34:58,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:58,877 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:58,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 03:34:58,877 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:58,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1134993929, now seen corresponding path program 1 times [2024-11-07 03:34:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:58,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574845803] [2024-11-07 03:34:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:59,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:59,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:59,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574845803] [2024-11-07 03:34:59,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574845803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:59,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:59,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:34:59,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919493613] [2024-11-07 03:34:59,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:59,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:34:59,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:59,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:34:59,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:34:59,186 INFO L87 Difference]: Start difference. First operand 3076 states and 4384 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:59,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:59,241 INFO L93 Difference]: Finished difference Result 5012 states and 7174 transitions. [2024-11-07 03:34:59,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:34:59,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247 [2024-11-07 03:34:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:59,246 INFO L225 Difference]: With dead ends: 5012 [2024-11-07 03:34:59,246 INFO L226 Difference]: Without dead ends: 3124 [2024-11-07 03:34:59,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:34:59,249 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 2 mSDsluCounter, 2915 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3890 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:59,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3890 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:59,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2024-11-07 03:34:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3112. [2024-11-07 03:34:59,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3112 states, 3086 states have (on average 1.4167206740116656) internal successors, (4372), 3086 states have internal predecessors, (4372), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:59,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3112 states to 3112 states and 4420 transitions. [2024-11-07 03:34:59,299 INFO L78 Accepts]: Start accepts. Automaton has 3112 states and 4420 transitions. Word has length 247 [2024-11-07 03:34:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 3112 states and 4420 transitions. [2024-11-07 03:34:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3112 states and 4420 transitions. [2024-11-07 03:34:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 03:34:59,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:59,304 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 03:34:59,308 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:59,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:59,309 INFO L85 PathProgramCache]: Analyzing trace with hash -103423597, now seen corresponding path program 1 times [2024-11-07 03:34:59,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:59,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034937730] [2024-11-07 03:34:59,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:59,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:59,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:34:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:34:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:34:59,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:34:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:34:59,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034937730] [2024-11-07 03:34:59,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034937730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:34:59,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:34:59,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:34:59,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541563415] [2024-11-07 03:34:59,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:34:59,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:34:59,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:34:59,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:34:59,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:59,635 INFO L87 Difference]: Start difference. First operand 3112 states and 4420 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:59,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:34:59,665 INFO L93 Difference]: Finished difference Result 5153 states and 7342 transitions. [2024-11-07 03:34:59,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:34:59,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247 [2024-11-07 03:34:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:34:59,669 INFO L225 Difference]: With dead ends: 5153 [2024-11-07 03:34:59,669 INFO L226 Difference]: Without dead ends: 3148 [2024-11-07 03:34:59,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:34:59,672 INFO L432 NwaCegarLoop]: 979 mSDtfsCounter, 0 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:34:59,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2929 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:34:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3148 states. [2024-11-07 03:34:59,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3148 to 3148. [2024-11-07 03:34:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3148 states, 3122 states have (on average 1.4119154388212685) internal successors, (4408), 3122 states have internal predecessors, (4408), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:34:59,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3148 states to 3148 states and 4456 transitions. [2024-11-07 03:34:59,703 INFO L78 Accepts]: Start accepts. Automaton has 3148 states and 4456 transitions. Word has length 247 [2024-11-07 03:34:59,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:34:59,703 INFO L471 AbstractCegarLoop]: Abstraction has 3148 states and 4456 transitions. [2024-11-07 03:34:59,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:34:59,703 INFO L276 IsEmpty]: Start isEmpty. Operand 3148 states and 4456 transitions. [2024-11-07 03:34:59,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 03:34:59,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:34:59,706 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:34:59,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-07 03:34:59,706 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:34:59,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:34:59,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1883332867, now seen corresponding path program 1 times [2024-11-07 03:34:59,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:34:59,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247746717] [2024-11-07 03:34:59,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:34:59,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:34:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:00,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:00,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:00,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:00,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247746717] [2024-11-07 03:35:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247746717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858614980] [2024-11-07 03:35:00,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:00,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:00,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:00,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:00,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:00,393 INFO L87 Difference]: Start difference. First operand 3148 states and 4456 transitions. Second operand has 11 states, 11 states have (on average 21.818181818181817) internal successors, (240), 11 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:00,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:00,827 INFO L93 Difference]: Finished difference Result 5136 states and 7309 transitions. [2024-11-07 03:35:00,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 03:35:00,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 21.818181818181817) internal successors, (240), 11 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 247 [2024-11-07 03:35:00,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:00,832 INFO L225 Difference]: With dead ends: 5136 [2024-11-07 03:35:00,832 INFO L226 Difference]: Without dead ends: 3188 [2024-11-07 03:35:00,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-07 03:35:00,835 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 2532 mSDsluCounter, 5663 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2532 SdHoareTripleChecker+Valid, 6571 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:00,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2532 Valid, 6571 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:35:00,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3188 states. [2024-11-07 03:35:00,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3188 to 3164. [2024-11-07 03:35:00,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3164 states, 3138 states have (on average 1.4098151688973868) internal successors, (4424), 3138 states have internal predecessors, (4424), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:00,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3164 states to 3164 states and 4472 transitions. [2024-11-07 03:35:00,869 INFO L78 Accepts]: Start accepts. Automaton has 3164 states and 4472 transitions. Word has length 247 [2024-11-07 03:35:00,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:00,870 INFO L471 AbstractCegarLoop]: Abstraction has 3164 states and 4472 transitions. [2024-11-07 03:35:00,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.818181818181817) internal successors, (240), 11 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:00,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3164 states and 4472 transitions. [2024-11-07 03:35:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 03:35:00,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:00,873 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:00,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 03:35:00,873 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:00,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:00,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1705134085, now seen corresponding path program 1 times [2024-11-07 03:35:00,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:00,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556971357] [2024-11-07 03:35:00,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:00,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:01,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:01,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:01,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556971357] [2024-11-07 03:35:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556971357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:01,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:01,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940319970] [2024-11-07 03:35:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:01,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:01,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:01,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:01,370 INFO L87 Difference]: Start difference. First operand 3164 states and 4472 transitions. Second operand has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:01,611 INFO L93 Difference]: Finished difference Result 4730 states and 6745 transitions. [2024-11-07 03:35:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247 [2024-11-07 03:35:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:01,616 INFO L225 Difference]: With dead ends: 4730 [2024-11-07 03:35:01,616 INFO L226 Difference]: Without dead ends: 3294 [2024-11-07 03:35:01,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:01,618 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1376 mSDsluCounter, 3541 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:01,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 4439 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:01,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2024-11-07 03:35:01,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3200. [2024-11-07 03:35:01,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3200 states, 3174 states have (on average 1.4095778197857594) internal successors, (4474), 3174 states have internal predecessors, (4474), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3200 states to 3200 states and 4522 transitions. [2024-11-07 03:35:01,656 INFO L78 Accepts]: Start accepts. Automaton has 3200 states and 4522 transitions. Word has length 247 [2024-11-07 03:35:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:01,658 INFO L471 AbstractCegarLoop]: Abstraction has 3200 states and 4522 transitions. [2024-11-07 03:35:01,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.285714285714285) internal successors, (240), 7 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:01,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3200 states and 4522 transitions. [2024-11-07 03:35:01,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-07 03:35:01,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:01,662 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:01,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-07 03:35:01,662 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:01,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1832431975, now seen corresponding path program 1 times [2024-11-07 03:35:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259044202] [2024-11-07 03:35:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:01,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:02,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:02,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:02,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:02,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259044202] [2024-11-07 03:35:02,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259044202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:02,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:02,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:02,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791122341] [2024-11-07 03:35:02,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:02,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:02,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:02,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:02,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:02,350 INFO L87 Difference]: Start difference. First operand 3200 states and 4522 transitions. Second operand has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:02,706 INFO L93 Difference]: Finished difference Result 5168 states and 7357 transitions. [2024-11-07 03:35:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 03:35:02,706 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 248 [2024-11-07 03:35:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:02,710 INFO L225 Difference]: With dead ends: 5168 [2024-11-07 03:35:02,710 INFO L226 Difference]: Without dead ends: 3240 [2024-11-07 03:35:02,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-07 03:35:02,712 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 1778 mSDsluCounter, 4887 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 5795 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:02,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 5795 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3240 states. [2024-11-07 03:35:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3240 to 3216. [2024-11-07 03:35:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3190 states have (on average 1.4075235109717867) internal successors, (4490), 3190 states have internal predecessors, (4490), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:02,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 4538 transitions. [2024-11-07 03:35:02,744 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 4538 transitions. Word has length 248 [2024-11-07 03:35:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:02,744 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 4538 transitions. [2024-11-07 03:35:02,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 21.90909090909091) internal successors, (241), 11 states have internal predecessors, (241), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:02,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 4538 transitions. [2024-11-07 03:35:02,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2024-11-07 03:35:02,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:02,746 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:02,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 03:35:02,747 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:02,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1312887972, now seen corresponding path program 1 times [2024-11-07 03:35:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:02,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532573604] [2024-11-07 03:35:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:02,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:02,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:03,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:03,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:03,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532573604] [2024-11-07 03:35:03,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532573604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:03,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:03,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:35:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116392039] [2024-11-07 03:35:03,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:03,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:35:03,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:03,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:35:03,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:35:03,154 INFO L87 Difference]: Start difference. First operand 3216 states and 4538 transitions. Second operand has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:03,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:03,262 INFO L93 Difference]: Finished difference Result 5526 states and 7888 transitions. [2024-11-07 03:35:03,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:35:03,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 249 [2024-11-07 03:35:03,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:03,268 INFO L225 Difference]: With dead ends: 5526 [2024-11-07 03:35:03,268 INFO L226 Difference]: Without dead ends: 3924 [2024-11-07 03:35:03,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:35:03,271 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 807 mSDsluCounter, 3861 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 4828 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:03,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 4828 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:03,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2024-11-07 03:35:03,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3248. [2024-11-07 03:35:03,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 3222 states have (on average 1.4072004965859715) internal successors, (4534), 3222 states have internal predecessors, (4534), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:03,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4582 transitions. [2024-11-07 03:35:03,321 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4582 transitions. Word has length 249 [2024-11-07 03:35:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:03,321 INFO L471 AbstractCegarLoop]: Abstraction has 3248 states and 4582 transitions. [2024-11-07 03:35:03,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.333333333333336) internal successors, (242), 6 states have internal predecessors, (242), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:03,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4582 transitions. [2024-11-07 03:35:03,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-07 03:35:03,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:03,325 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:03,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 03:35:03,325 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:03,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:03,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1026563322, now seen corresponding path program 1 times [2024-11-07 03:35:03,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069215130] [2024-11-07 03:35:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:03,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:03,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:03,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:03,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:03,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:03,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:03,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069215130] [2024-11-07 03:35:03,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069215130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:03,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:03,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:35:03,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271344374] [2024-11-07 03:35:03,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:03,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:35:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:35:03,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:35:03,738 INFO L87 Difference]: Start difference. First operand 3248 states and 4582 transitions. Second operand has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:03,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:03,820 INFO L93 Difference]: Finished difference Result 4758 states and 6770 transitions. [2024-11-07 03:35:03,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:35:03,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 250 [2024-11-07 03:35:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:03,824 INFO L225 Difference]: With dead ends: 4758 [2024-11-07 03:35:03,824 INFO L226 Difference]: Without dead ends: 3310 [2024-11-07 03:35:03,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:35:03,830 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 288 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:03,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 4830 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2024-11-07 03:35:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 3264. [2024-11-07 03:35:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3264 states, 3238 states have (on average 1.407041383570105) internal successors, (4556), 3238 states have internal predecessors, (4556), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:03,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3264 states to 3264 states and 4604 transitions. [2024-11-07 03:35:03,863 INFO L78 Accepts]: Start accepts. Automaton has 3264 states and 4604 transitions. Word has length 250 [2024-11-07 03:35:03,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:03,863 INFO L471 AbstractCegarLoop]: Abstraction has 3264 states and 4604 transitions. [2024-11-07 03:35:03,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:03,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3264 states and 4604 transitions. [2024-11-07 03:35:03,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-07 03:35:03,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:03,866 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:03,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-07 03:35:03,866 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:03,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:03,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1455242069, now seen corresponding path program 1 times [2024-11-07 03:35:03,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:03,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552255617] [2024-11-07 03:35:03,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:03,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:04,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:04,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:04,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:04,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552255617] [2024-11-07 03:35:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552255617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:04,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:04,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363156798] [2024-11-07 03:35:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:04,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:04,358 INFO L87 Difference]: Start difference. First operand 3264 states and 4604 transitions. Second operand has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:04,569 INFO L93 Difference]: Finished difference Result 4806 states and 6840 transitions. [2024-11-07 03:35:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:04,569 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 250 [2024-11-07 03:35:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:04,573 INFO L225 Difference]: With dead ends: 4806 [2024-11-07 03:35:04,573 INFO L226 Difference]: Without dead ends: 3358 [2024-11-07 03:35:04,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:04,575 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1472 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:04,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 4433 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3358 states. [2024-11-07 03:35:04,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3358 to 3280. [2024-11-07 03:35:04,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3280 states, 3254 states have (on average 1.4068838352796558) internal successors, (4578), 3254 states have internal predecessors, (4578), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:04,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 4626 transitions. [2024-11-07 03:35:04,614 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 4626 transitions. Word has length 250 [2024-11-07 03:35:04,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:04,614 INFO L471 AbstractCegarLoop]: Abstraction has 3280 states and 4626 transitions. [2024-11-07 03:35:04,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.714285714285715) internal successors, (243), 7 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 4626 transitions. [2024-11-07 03:35:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-07 03:35:04,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:04,617 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:04,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-07 03:35:04,617 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:04,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:04,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1058573877, now seen corresponding path program 1 times [2024-11-07 03:35:04,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347419316] [2024-11-07 03:35:04,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:04,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:04,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:04,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347419316] [2024-11-07 03:35:04,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347419316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:04,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:04,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:35:04,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569676891] [2024-11-07 03:35:04,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:04,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:35:04,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:04,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:35:04,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:35:04,978 INFO L87 Difference]: Start difference. First operand 3280 states and 4626 transitions. Second operand has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:05,064 INFO L93 Difference]: Finished difference Result 4774 states and 6790 transitions. [2024-11-07 03:35:05,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:35:05,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2024-11-07 03:35:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:05,068 INFO L225 Difference]: With dead ends: 4774 [2024-11-07 03:35:05,068 INFO L226 Difference]: Without dead ends: 3326 [2024-11-07 03:35:05,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:35:05,069 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 282 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:05,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 4830 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3326 states. [2024-11-07 03:35:05,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3326 to 3296. [2024-11-07 03:35:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3296 states, 3270 states have (on average 1.4067278287461773) internal successors, (4600), 3270 states have internal predecessors, (4600), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:05,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3296 states to 3296 states and 4648 transitions. [2024-11-07 03:35:05,103 INFO L78 Accepts]: Start accepts. Automaton has 3296 states and 4648 transitions. Word has length 251 [2024-11-07 03:35:05,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:05,104 INFO L471 AbstractCegarLoop]: Abstraction has 3296 states and 4648 transitions. [2024-11-07 03:35:05,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:05,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3296 states and 4648 transitions. [2024-11-07 03:35:05,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-07 03:35:05,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:05,107 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:05,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-07 03:35:05,107 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:05,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1386608214, now seen corresponding path program 1 times [2024-11-07 03:35:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:05,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110166101] [2024-11-07 03:35:05,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:05,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:05,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:05,597 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:05,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:05,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110166101] [2024-11-07 03:35:05,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110166101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:05,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:05,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:05,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017869667] [2024-11-07 03:35:05,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:05,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:05,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:05,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:05,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:05,598 INFO L87 Difference]: Start difference. First operand 3296 states and 4648 transitions. Second operand has 9 states, 9 states have (on average 27.11111111111111) internal successors, (244), 9 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:05,784 INFO L93 Difference]: Finished difference Result 5706 states and 8132 transitions. [2024-11-07 03:35:05,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:35:05,784 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.11111111111111) internal successors, (244), 9 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2024-11-07 03:35:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:05,788 INFO L225 Difference]: With dead ends: 5706 [2024-11-07 03:35:05,788 INFO L226 Difference]: Without dead ends: 4012 [2024-11-07 03:35:05,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:05,790 INFO L432 NwaCegarLoop]: 958 mSDtfsCounter, 2462 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 6670 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:05,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 6670 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4012 states. [2024-11-07 03:35:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4012 to 3304. [2024-11-07 03:35:05,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3304 states, 3278 states have (on average 1.4057352043929225) internal successors, (4608), 3278 states have internal predecessors, (4608), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:05,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4656 transitions. [2024-11-07 03:35:05,824 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 4656 transitions. Word has length 251 [2024-11-07 03:35:05,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:05,824 INFO L471 AbstractCegarLoop]: Abstraction has 3304 states and 4656 transitions. [2024-11-07 03:35:05,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.11111111111111) internal successors, (244), 9 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 4656 transitions. [2024-11-07 03:35:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-11-07 03:35:05,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:05,827 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:05,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-07 03:35:05,827 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:05,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:05,827 INFO L85 PathProgramCache]: Analyzing trace with hash 426653594, now seen corresponding path program 1 times [2024-11-07 03:35:05,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:05,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062513654] [2024-11-07 03:35:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:05,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:06,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:06,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:06,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062513654] [2024-11-07 03:35:06,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062513654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:06,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:06,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:06,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622820070] [2024-11-07 03:35:06,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:06,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:06,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:06,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:06,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:06,342 INFO L87 Difference]: Start difference. First operand 3304 states and 4656 transitions. Second operand has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:06,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:06,569 INFO L93 Difference]: Finished difference Result 4832 states and 6870 transitions. [2024-11-07 03:35:06,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:06,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251 [2024-11-07 03:35:06,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:06,573 INFO L225 Difference]: With dead ends: 4832 [2024-11-07 03:35:06,573 INFO L226 Difference]: Without dead ends: 3382 [2024-11-07 03:35:06,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:06,575 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1460 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:06,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 4433 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:06,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3382 states. [2024-11-07 03:35:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3382 to 3320. [2024-11-07 03:35:06,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3320 states, 3294 states have (on average 1.4055859137826352) internal successors, (4630), 3294 states have internal predecessors, (4630), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:06,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3320 states to 3320 states and 4678 transitions. [2024-11-07 03:35:06,605 INFO L78 Accepts]: Start accepts. Automaton has 3320 states and 4678 transitions. Word has length 251 [2024-11-07 03:35:06,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:06,605 INFO L471 AbstractCegarLoop]: Abstraction has 3320 states and 4678 transitions. [2024-11-07 03:35:06,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:06,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3320 states and 4678 transitions. [2024-11-07 03:35:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-07 03:35:06,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:06,608 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:06,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-07 03:35:06,608 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:06,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash -922508668, now seen corresponding path program 1 times [2024-11-07 03:35:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:06,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151703150] [2024-11-07 03:35:06,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:06,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:06,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:06,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:06,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:06,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151703150] [2024-11-07 03:35:06,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151703150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:06,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:06,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:35:06,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227325619] [2024-11-07 03:35:06,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:06,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:35:06,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:06,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:35:06,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:35:06,966 INFO L87 Difference]: Start difference. First operand 3320 states and 4678 transitions. Second operand has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:07,045 INFO L93 Difference]: Finished difference Result 4800 states and 6820 transitions. [2024-11-07 03:35:07,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:35:07,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 252 [2024-11-07 03:35:07,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:07,054 INFO L225 Difference]: With dead ends: 4800 [2024-11-07 03:35:07,055 INFO L226 Difference]: Without dead ends: 3350 [2024-11-07 03:35:07,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:35:07,058 INFO L432 NwaCegarLoop]: 967 mSDtfsCounter, 276 mSDsluCounter, 3863 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 4830 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:07,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 4830 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2024-11-07 03:35:07,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 3336. [2024-11-07 03:35:07,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3336 states, 3310 states have (on average 1.4054380664652568) internal successors, (4652), 3310 states have internal predecessors, (4652), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:07,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 4700 transitions. [2024-11-07 03:35:07,098 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 4700 transitions. Word has length 252 [2024-11-07 03:35:07,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:07,098 INFO L471 AbstractCegarLoop]: Abstraction has 3336 states and 4700 transitions. [2024-11-07 03:35:07,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 40.833333333333336) internal successors, (245), 6 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:07,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 4700 transitions. [2024-11-07 03:35:07,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-07 03:35:07,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:07,103 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:07,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-07 03:35:07,103 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:07,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:07,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1666075245, now seen corresponding path program 1 times [2024-11-07 03:35:07,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:07,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786002056] [2024-11-07 03:35:07,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:07,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:07,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:07,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:07,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:07,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786002056] [2024-11-07 03:35:07,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786002056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:07,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:07,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:07,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293365605] [2024-11-07 03:35:07,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:07,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:07,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:07,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:07,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:07,796 INFO L87 Difference]: Start difference. First operand 3336 states and 4700 transitions. Second operand has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:07,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:07,969 INFO L93 Difference]: Finished difference Result 5756 states and 8197 transitions. [2024-11-07 03:35:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:35:07,969 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 252 [2024-11-07 03:35:07,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:07,974 INFO L225 Difference]: With dead ends: 5756 [2024-11-07 03:35:07,974 INFO L226 Difference]: Without dead ends: 4068 [2024-11-07 03:35:07,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:07,977 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 2449 mSDsluCounter, 4882 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2451 SdHoareTripleChecker+Valid, 5841 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:07,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2451 Valid, 5841 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4068 states. [2024-11-07 03:35:08,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4068 to 3344. [2024-11-07 03:35:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3344 states, 3318 states have (on average 1.404460518384569) internal successors, (4660), 3318 states have internal predecessors, (4660), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3344 states to 3344 states and 4708 transitions. [2024-11-07 03:35:08,013 INFO L78 Accepts]: Start accepts. Automaton has 3344 states and 4708 transitions. Word has length 252 [2024-11-07 03:35:08,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:08,013 INFO L471 AbstractCegarLoop]: Abstraction has 3344 states and 4708 transitions. [2024-11-07 03:35:08,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.22222222222222) internal successors, (245), 9 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:08,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3344 states and 4708 transitions. [2024-11-07 03:35:08,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-07 03:35:08,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:08,016 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:08,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-07 03:35:08,016 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:08,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:08,016 INFO L85 PathProgramCache]: Analyzing trace with hash -167961864, now seen corresponding path program 1 times [2024-11-07 03:35:08,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:08,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925692465] [2024-11-07 03:35:08,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:08,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:08,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:08,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925692465] [2024-11-07 03:35:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925692465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18466370] [2024-11-07 03:35:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:08,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:08,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:08,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:08,697 INFO L87 Difference]: Start difference. First operand 3344 states and 4708 transitions. Second operand has 11 states, 11 states have (on average 22.272727272727273) internal successors, (245), 11 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:09,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:09,065 INFO L93 Difference]: Finished difference Result 5360 states and 7606 transitions. [2024-11-07 03:35:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 03:35:09,066 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.272727272727273) internal successors, (245), 11 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 252 [2024-11-07 03:35:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:09,069 INFO L225 Difference]: With dead ends: 5360 [2024-11-07 03:35:09,069 INFO L226 Difference]: Without dead ends: 3384 [2024-11-07 03:35:09,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-07 03:35:09,071 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 2518 mSDsluCounter, 5669 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2518 SdHoareTripleChecker+Valid, 6577 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:09,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2518 Valid, 6577 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:09,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2024-11-07 03:35:09,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 3360. [2024-11-07 03:35:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3360 states, 3334 states have (on average 1.4025194961007799) internal successors, (4676), 3334 states have internal predecessors, (4676), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:09,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3360 states to 3360 states and 4724 transitions. [2024-11-07 03:35:09,104 INFO L78 Accepts]: Start accepts. Automaton has 3360 states and 4724 transitions. Word has length 252 [2024-11-07 03:35:09,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:09,104 INFO L471 AbstractCegarLoop]: Abstraction has 3360 states and 4724 transitions. [2024-11-07 03:35:09,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.272727272727273) internal successors, (245), 11 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:09,104 INFO L276 IsEmpty]: Start isEmpty. Operand 3360 states and 4724 transitions. [2024-11-07 03:35:09,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-07 03:35:09,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:09,107 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:09,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-07 03:35:09,107 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:09,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:09,107 INFO L85 PathProgramCache]: Analyzing trace with hash -525111544, now seen corresponding path program 1 times [2024-11-07 03:35:09,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:09,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349301895] [2024-11-07 03:35:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:09,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:09,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:09,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:09,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:09,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:09,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349301895] [2024-11-07 03:35:09,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349301895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:09,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:09,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:09,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606181182] [2024-11-07 03:35:09,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:09,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:09,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:09,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:09,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:09,618 INFO L87 Difference]: Start difference. First operand 3360 states and 4724 transitions. Second operand has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:09,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:09,824 INFO L93 Difference]: Finished difference Result 4878 states and 6920 transitions. [2024-11-07 03:35:09,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:09,825 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 252 [2024-11-07 03:35:09,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:09,828 INFO L225 Difference]: With dead ends: 4878 [2024-11-07 03:35:09,828 INFO L226 Difference]: Without dead ends: 3422 [2024-11-07 03:35:09,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:09,830 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1218 mSDsluCounter, 3559 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 4457 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:09,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 4457 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:09,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3422 states. [2024-11-07 03:35:09,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3422 to 3376. [2024-11-07 03:35:09,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 3350 states have (on average 1.4023880597014926) internal successors, (4698), 3350 states have internal predecessors, (4698), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:09,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 4746 transitions. [2024-11-07 03:35:09,860 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 4746 transitions. Word has length 252 [2024-11-07 03:35:09,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:09,860 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 4746 transitions. [2024-11-07 03:35:09,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.0) internal successors, (245), 7 states have internal predecessors, (245), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:09,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 4746 transitions. [2024-11-07 03:35:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-07 03:35:09,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:09,862 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:09,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-07 03:35:09,863 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:09,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:09,863 INFO L85 PathProgramCache]: Analyzing trace with hash -902060290, now seen corresponding path program 1 times [2024-11-07 03:35:09,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:09,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082084364] [2024-11-07 03:35:09,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:09,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:10,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:10,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:10,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:10,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:10,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082084364] [2024-11-07 03:35:10,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082084364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:10,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:10,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:35:10,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579321435] [2024-11-07 03:35:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:10,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:35:10,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:10,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:35:10,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:35:10,247 INFO L87 Difference]: Start difference. First operand 3376 states and 4746 transitions. Second operand has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:10,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:10,317 INFO L93 Difference]: Finished difference Result 4852 states and 6880 transitions. [2024-11-07 03:35:10,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:35:10,318 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253 [2024-11-07 03:35:10,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:10,321 INFO L225 Difference]: With dead ends: 4852 [2024-11-07 03:35:10,321 INFO L226 Difference]: Without dead ends: 3396 [2024-11-07 03:35:10,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:10,323 INFO L432 NwaCegarLoop]: 965 mSDtfsCounter, 271 mSDsluCounter, 3854 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 4819 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:10,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 4819 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:10,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2024-11-07 03:35:10,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3392. [2024-11-07 03:35:10,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3392 states, 3366 states have (on average 1.4022578728461081) internal successors, (4720), 3366 states have internal predecessors, (4720), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4768 transitions. [2024-11-07 03:35:10,355 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4768 transitions. Word has length 253 [2024-11-07 03:35:10,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:10,355 INFO L471 AbstractCegarLoop]: Abstraction has 3392 states and 4768 transitions. [2024-11-07 03:35:10,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.0) internal successors, (246), 6 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:10,355 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4768 transitions. [2024-11-07 03:35:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-07 03:35:10,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:10,357 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:10,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-07 03:35:10,359 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:10,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:10,359 INFO L85 PathProgramCache]: Analyzing trace with hash -576290189, now seen corresponding path program 1 times [2024-11-07 03:35:10,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:10,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431496837] [2024-11-07 03:35:10,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:10,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:10,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:10,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:10,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:10,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:10,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431496837] [2024-11-07 03:35:10,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431496837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:10,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:10,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:10,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347705267] [2024-11-07 03:35:10,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:10,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:10,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:10,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:10,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:10,837 INFO L87 Difference]: Start difference. First operand 3392 states and 4768 transitions. Second operand has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:11,057 INFO L93 Difference]: Finished difference Result 4894 states and 6940 transitions. [2024-11-07 03:35:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253 [2024-11-07 03:35:11,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:11,061 INFO L225 Difference]: With dead ends: 4894 [2024-11-07 03:35:11,061 INFO L226 Difference]: Without dead ends: 3438 [2024-11-07 03:35:11,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:11,063 INFO L432 NwaCegarLoop]: 898 mSDtfsCounter, 1436 mSDsluCounter, 3535 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 4433 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:11,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 4433 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:11,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3438 states. [2024-11-07 03:35:11,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3438 to 3408. [2024-11-07 03:35:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3408 states, 3382 states have (on average 1.4021289178001182) internal successors, (4742), 3382 states have internal predecessors, (4742), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3408 states to 3408 states and 4790 transitions. [2024-11-07 03:35:11,095 INFO L78 Accepts]: Start accepts. Automaton has 3408 states and 4790 transitions. Word has length 253 [2024-11-07 03:35:11,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:11,095 INFO L471 AbstractCegarLoop]: Abstraction has 3408 states and 4790 transitions. [2024-11-07 03:35:11,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.142857142857146) internal successors, (246), 7 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:11,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3408 states and 4790 transitions. [2024-11-07 03:35:11,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-07 03:35:11,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:11,098 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:11,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-07 03:35:11,098 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:11,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:11,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1503832345, now seen corresponding path program 1 times [2024-11-07 03:35:11,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:11,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424121545] [2024-11-07 03:35:11,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:11,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:11,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424121545] [2024-11-07 03:35:11,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424121545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:11,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:11,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:11,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124936134] [2024-11-07 03:35:11,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:11,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:11,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:11,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:11,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:11,813 INFO L87 Difference]: Start difference. First operand 3408 states and 4790 transitions. Second operand has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:12,169 INFO L93 Difference]: Finished difference Result 5428 states and 7692 transitions. [2024-11-07 03:35:12,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 03:35:12,170 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 254 [2024-11-07 03:35:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:12,174 INFO L225 Difference]: With dead ends: 5428 [2024-11-07 03:35:12,174 INFO L226 Difference]: Without dead ends: 3448 [2024-11-07 03:35:12,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-07 03:35:12,176 INFO L432 NwaCegarLoop]: 908 mSDtfsCounter, 2515 mSDsluCounter, 5669 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2515 SdHoareTripleChecker+Valid, 6577 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:12,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2515 Valid, 6577 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3448 states. [2024-11-07 03:35:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3448 to 3424. [2024-11-07 03:35:12,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3424 states, 3398 states have (on average 1.4002354326074162) internal successors, (4758), 3398 states have internal predecessors, (4758), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3424 states to 3424 states and 4806 transitions. [2024-11-07 03:35:12,216 INFO L78 Accepts]: Start accepts. Automaton has 3424 states and 4806 transitions. Word has length 254 [2024-11-07 03:35:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:12,216 INFO L471 AbstractCegarLoop]: Abstraction has 3424 states and 4806 transitions. [2024-11-07 03:35:12,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 22.454545454545453) internal successors, (247), 11 states have internal predecessors, (247), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 3424 states and 4806 transitions. [2024-11-07 03:35:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 03:35:12,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:12,219 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:12,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-07 03:35:12,219 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:12,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:12,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1488766543, now seen corresponding path program 1 times [2024-11-07 03:35:12,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:12,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179447558] [2024-11-07 03:35:12,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:12,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:12,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:12,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:12,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:12,506 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:12,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:12,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179447558] [2024-11-07 03:35:12,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179447558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:12,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:12,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:12,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164575528] [2024-11-07 03:35:12,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:12,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:12,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:12,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:12,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:12,508 INFO L87 Difference]: Start difference. First operand 3424 states and 4806 transitions. Second operand has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:12,563 INFO L93 Difference]: Finished difference Result 5450 states and 7708 transitions. [2024-11-07 03:35:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 255 [2024-11-07 03:35:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:12,567 INFO L225 Difference]: With dead ends: 5450 [2024-11-07 03:35:12,567 INFO L226 Difference]: Without dead ends: 3472 [2024-11-07 03:35:12,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:35:12,570 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:12,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3886 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:12,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3472 states. [2024-11-07 03:35:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3472 to 3460. [2024-11-07 03:35:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 3434 states have (on average 1.398369248689575) internal successors, (4802), 3434 states have internal predecessors, (4802), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 4850 transitions. [2024-11-07 03:35:12,605 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 4850 transitions. Word has length 255 [2024-11-07 03:35:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:12,605 INFO L471 AbstractCegarLoop]: Abstraction has 3460 states and 4850 transitions. [2024-11-07 03:35:12,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.6) internal successors, (248), 5 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:12,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 4850 transitions. [2024-11-07 03:35:12,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 03:35:12,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:12,608 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:12,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-07 03:35:12,608 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:12,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:12,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1132298475, now seen corresponding path program 1 times [2024-11-07 03:35:12,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:12,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775484854] [2024-11-07 03:35:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:12,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:12,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:12,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:12,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:12,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775484854] [2024-11-07 03:35:12,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775484854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:12,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:12,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:35:12,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888564587] [2024-11-07 03:35:12,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:12,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:35:12,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:12,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:35:12,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:12,874 INFO L87 Difference]: Start difference. First operand 3460 states and 4850 transitions. Second operand has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:12,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:12,903 INFO L93 Difference]: Finished difference Result 5591 states and 7890 transitions. [2024-11-07 03:35:12,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:35:12,904 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 255 [2024-11-07 03:35:12,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:12,907 INFO L225 Difference]: With dead ends: 5591 [2024-11-07 03:35:12,907 INFO L226 Difference]: Without dead ends: 3496 [2024-11-07 03:35:12,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:12,909 INFO L432 NwaCegarLoop]: 979 mSDtfsCounter, 0 mSDsluCounter, 1950 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2929 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:12,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2929 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:12,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2024-11-07 03:35:12,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3496. [2024-11-07 03:35:12,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3496 states, 3470 states have (on average 1.3942363112391931) internal successors, (4838), 3470 states have internal predecessors, (4838), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:12,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3496 states to 3496 states and 4886 transitions. [2024-11-07 03:35:12,945 INFO L78 Accepts]: Start accepts. Automaton has 3496 states and 4886 transitions. Word has length 255 [2024-11-07 03:35:12,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:12,945 INFO L471 AbstractCegarLoop]: Abstraction has 3496 states and 4886 transitions. [2024-11-07 03:35:12,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:12,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3496 states and 4886 transitions. [2024-11-07 03:35:12,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 03:35:12,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:12,948 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:12,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-07 03:35:12,948 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:12,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:12,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1869114590, now seen corresponding path program 1 times [2024-11-07 03:35:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:12,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732518104] [2024-11-07 03:35:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:13,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:13,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:13,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:13,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732518104] [2024-11-07 03:35:13,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732518104] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:13,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:13,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:13,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221677814] [2024-11-07 03:35:13,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:13,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:13,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:13,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:13,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:13,353 INFO L87 Difference]: Start difference. First operand 3496 states and 4886 transitions. Second operand has 9 states, 9 states have (on average 27.555555555555557) internal successors, (248), 9 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:13,513 INFO L93 Difference]: Finished difference Result 5454 states and 7659 transitions. [2024-11-07 03:35:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:13,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.555555555555557) internal successors, (248), 9 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 255 [2024-11-07 03:35:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:13,517 INFO L225 Difference]: With dead ends: 5454 [2024-11-07 03:35:13,518 INFO L226 Difference]: Without dead ends: 3892 [2024-11-07 03:35:13,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:13,520 INFO L432 NwaCegarLoop]: 1121 mSDtfsCounter, 434 mSDsluCounter, 6751 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 7872 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:13,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 7872 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:13,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3892 states. [2024-11-07 03:35:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3892 to 3796. [2024-11-07 03:35:13,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3770 states have (on average 1.3885941644562334) internal successors, (5235), 3770 states have internal predecessors, (5235), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 5283 transitions. [2024-11-07 03:35:13,553 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 5283 transitions. Word has length 255 [2024-11-07 03:35:13,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:13,553 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 5283 transitions. [2024-11-07 03:35:13,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.555555555555557) internal successors, (248), 9 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:13,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 5283 transitions. [2024-11-07 03:35:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 03:35:13,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:13,555 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:13,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-07 03:35:13,556 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:13,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash -432256301, now seen corresponding path program 1 times [2024-11-07 03:35:13,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:13,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780818206] [2024-11-07 03:35:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:14,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:14,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:14,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780818206] [2024-11-07 03:35:14,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780818206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:14,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:14,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:14,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770505358] [2024-11-07 03:35:14,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:14,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:14,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:14,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:14,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:14,068 INFO L87 Difference]: Start difference. First operand 3796 states and 5283 transitions. Second operand has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:14,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:14,258 INFO L93 Difference]: Finished difference Result 5900 states and 8291 transitions. [2024-11-07 03:35:14,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:35:14,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 255 [2024-11-07 03:35:14,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:14,263 INFO L225 Difference]: With dead ends: 5900 [2024-11-07 03:35:14,263 INFO L226 Difference]: Without dead ends: 3796 [2024-11-07 03:35:14,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:14,265 INFO L432 NwaCegarLoop]: 893 mSDtfsCounter, 1677 mSDsluCounter, 2735 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1677 SdHoareTripleChecker+Valid, 3628 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:14,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1677 Valid, 3628 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2024-11-07 03:35:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3796. [2024-11-07 03:35:14,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3770 states have (on average 1.3832891246684351) internal successors, (5215), 3770 states have internal predecessors, (5215), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:14,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 5263 transitions. [2024-11-07 03:35:14,297 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 5263 transitions. Word has length 255 [2024-11-07 03:35:14,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:14,298 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 5263 transitions. [2024-11-07 03:35:14,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:14,298 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 5263 transitions. [2024-11-07 03:35:14,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 03:35:14,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:14,300 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:14,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-07 03:35:14,300 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:14,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:14,301 INFO L85 PathProgramCache]: Analyzing trace with hash 252340414, now seen corresponding path program 1 times [2024-11-07 03:35:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:14,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325570997] [2024-11-07 03:35:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:14,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:14,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:14,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325570997] [2024-11-07 03:35:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325570997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:14,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627182390] [2024-11-07 03:35:14,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:14,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:14,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:14,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:14,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:14,787 INFO L87 Difference]: Start difference. First operand 3796 states and 5263 transitions. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:14,957 INFO L93 Difference]: Finished difference Result 5366 states and 7513 transitions. [2024-11-07 03:35:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:14,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256 [2024-11-07 03:35:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:14,961 INFO L225 Difference]: With dead ends: 5366 [2024-11-07 03:35:14,961 INFO L226 Difference]: Without dead ends: 3804 [2024-11-07 03:35:14,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:14,964 INFO L432 NwaCegarLoop]: 954 mSDtfsCounter, 1274 mSDsluCounter, 5699 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 6653 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:14,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 6653 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3804 states. [2024-11-07 03:35:14,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3804 to 3500. [2024-11-07 03:35:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3500 states, 3474 states have (on average 1.3891767415083478) internal successors, (4826), 3474 states have internal predecessors, (4826), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4874 transitions. [2024-11-07 03:35:14,997 INFO L78 Accepts]: Start accepts. Automaton has 3500 states and 4874 transitions. Word has length 256 [2024-11-07 03:35:14,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:14,997 INFO L471 AbstractCegarLoop]: Abstraction has 3500 states and 4874 transitions. [2024-11-07 03:35:14,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 3500 states and 4874 transitions. [2024-11-07 03:35:15,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 03:35:15,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:15,000 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-07 03:35:15,000 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:15,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash 58927693, now seen corresponding path program 1 times [2024-11-07 03:35:15,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:15,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825019558] [2024-11-07 03:35:15,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:15,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:15,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:15,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:15,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:15,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825019558] [2024-11-07 03:35:15,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825019558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:15,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:15,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:15,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075018600] [2024-11-07 03:35:15,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:15,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:15,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:15,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:15,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:15,494 INFO L87 Difference]: Start difference. First operand 3500 states and 4874 transitions. Second operand has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:15,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:15,680 INFO L93 Difference]: Finished difference Result 5976 states and 8434 transitions. [2024-11-07 03:35:15,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:35:15,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256 [2024-11-07 03:35:15,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:15,685 INFO L225 Difference]: With dead ends: 5976 [2024-11-07 03:35:15,685 INFO L226 Difference]: Without dead ends: 4258 [2024-11-07 03:35:15,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:15,688 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 2434 mSDsluCounter, 5722 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 6681 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:15,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 6681 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4258 states. [2024-11-07 03:35:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4258 to 3508. [2024-11-07 03:35:15,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3508 states, 3482 states have (on average 1.3882825962090752) internal successors, (4834), 3482 states have internal predecessors, (4834), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3508 states to 3508 states and 4882 transitions. [2024-11-07 03:35:15,722 INFO L78 Accepts]: Start accepts. Automaton has 3508 states and 4882 transitions. Word has length 256 [2024-11-07 03:35:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:15,723 INFO L471 AbstractCegarLoop]: Abstraction has 3508 states and 4882 transitions. [2024-11-07 03:35:15,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.666666666666668) internal successors, (249), 9 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 3508 states and 4882 transitions. [2024-11-07 03:35:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 03:35:15,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:15,725 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:15,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-07 03:35:15,725 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:15,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:15,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1213720677, now seen corresponding path program 1 times [2024-11-07 03:35:15,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:15,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223671751] [2024-11-07 03:35:15,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:15,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:16,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:16,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:16,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:16,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:16,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223671751] [2024-11-07 03:35:16,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223671751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:16,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:16,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412342655] [2024-11-07 03:35:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:16,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:16,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:16,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:16,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:16,233 INFO L87 Difference]: Start difference. First operand 3508 states and 4882 transitions. Second operand has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:16,436 INFO L93 Difference]: Finished difference Result 5018 states and 7052 transitions. [2024-11-07 03:35:16,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:16,437 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256 [2024-11-07 03:35:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:16,441 INFO L225 Difference]: With dead ends: 5018 [2024-11-07 03:35:16,441 INFO L226 Difference]: Without dead ends: 3538 [2024-11-07 03:35:16,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:16,444 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 1202 mSDsluCounter, 3555 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 4452 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:16,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 4452 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2024-11-07 03:35:16,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3524. [2024-11-07 03:35:16,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3524 states, 3498 states have (on average 1.3882218410520297) internal successors, (4856), 3498 states have internal predecessors, (4856), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 4904 transitions. [2024-11-07 03:35:16,476 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 4904 transitions. Word has length 256 [2024-11-07 03:35:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:16,477 INFO L471 AbstractCegarLoop]: Abstraction has 3524 states and 4904 transitions. [2024-11-07 03:35:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 4904 transitions. [2024-11-07 03:35:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-07 03:35:16,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:16,479 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:16,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-07 03:35:16,480 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:16,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1662742922, now seen corresponding path program 1 times [2024-11-07 03:35:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:16,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761208698] [2024-11-07 03:35:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:16,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:16,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:16,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:16,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:16,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:16,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:16,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761208698] [2024-11-07 03:35:16,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761208698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:16,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:16,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:16,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698419348] [2024-11-07 03:35:16,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:16,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:16,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:16,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:16,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:16,772 INFO L87 Difference]: Start difference. First operand 3524 states and 4904 transitions. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:16,819 INFO L93 Difference]: Finished difference Result 5164 states and 7248 transitions. [2024-11-07 03:35:16,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:16,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 257 [2024-11-07 03:35:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:16,824 INFO L225 Difference]: With dead ends: 5164 [2024-11-07 03:35:16,824 INFO L226 Difference]: Without dead ends: 3548 [2024-11-07 03:35:16,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:35:16,827 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:16,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3885 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2024-11-07 03:35:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3542. [2024-11-07 03:35:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3542 states, 3516 states have (on average 1.3868031854379976) internal successors, (4876), 3516 states have internal predecessors, (4876), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:16,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3542 states to 3542 states and 4924 transitions. [2024-11-07 03:35:16,860 INFO L78 Accepts]: Start accepts. Automaton has 3542 states and 4924 transitions. Word has length 257 [2024-11-07 03:35:16,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:16,860 INFO L471 AbstractCegarLoop]: Abstraction has 3542 states and 4924 transitions. [2024-11-07 03:35:16,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3542 states and 4924 transitions. [2024-11-07 03:35:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-07 03:35:16,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:16,862 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:16,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-07 03:35:16,863 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:16,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:16,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1938363666, now seen corresponding path program 1 times [2024-11-07 03:35:16,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:16,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636626581] [2024-11-07 03:35:16,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:16,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:17,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:17,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:17,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:17,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:17,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:17,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636626581] [2024-11-07 03:35:17,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636626581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:17,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:17,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:35:17,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819424167] [2024-11-07 03:35:17,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:35:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:17,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:35:17,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:17,160 INFO L87 Difference]: Start difference. First operand 3542 states and 4924 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:17,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:17,192 INFO L93 Difference]: Finished difference Result 5230 states and 7330 transitions. [2024-11-07 03:35:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:35:17,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 257 [2024-11-07 03:35:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:17,196 INFO L225 Difference]: With dead ends: 5230 [2024-11-07 03:35:17,196 INFO L226 Difference]: Without dead ends: 3560 [2024-11-07 03:35:17,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:17,198 INFO L432 NwaCegarLoop]: 977 mSDtfsCounter, 0 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:17,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2923 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2024-11-07 03:35:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3560. [2024-11-07 03:35:17,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3560 states, 3534 states have (on average 1.3853989813242784) internal successors, (4896), 3534 states have internal predecessors, (4896), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:17,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 4944 transitions. [2024-11-07 03:35:17,232 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 4944 transitions. Word has length 257 [2024-11-07 03:35:17,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:17,235 INFO L471 AbstractCegarLoop]: Abstraction has 3560 states and 4944 transitions. [2024-11-07 03:35:17,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:17,235 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 4944 transitions. [2024-11-07 03:35:17,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-07 03:35:17,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:17,238 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:17,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-07 03:35:17,238 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:17,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:17,238 INFO L85 PathProgramCache]: Analyzing trace with hash 818104018, now seen corresponding path program 1 times [2024-11-07 03:35:17,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:17,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557004582] [2024-11-07 03:35:17,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:17,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:17,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:17,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:17,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557004582] [2024-11-07 03:35:17,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557004582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:17,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:17,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:17,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178135594] [2024-11-07 03:35:17,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:17,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:17,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:17,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:17,796 INFO L87 Difference]: Start difference. First operand 3560 states and 4944 transitions. Second operand has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:17,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:17,971 INFO L93 Difference]: Finished difference Result 6268 states and 8786 transitions. [2024-11-07 03:35:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:35:17,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 257 [2024-11-07 03:35:17,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:17,977 INFO L225 Difference]: With dead ends: 6268 [2024-11-07 03:35:17,977 INFO L226 Difference]: Without dead ends: 4336 [2024-11-07 03:35:17,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:17,982 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 1802 mSDsluCounter, 5740 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1804 SdHoareTripleChecker+Valid, 6699 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:17,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1804 Valid, 6699 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:17,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4336 states. [2024-11-07 03:35:18,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4336 to 3564. [2024-11-07 03:35:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3564 states, 3538 states have (on average 1.3849632560768796) internal successors, (4900), 3538 states have internal predecessors, (4900), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:18,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3564 states to 3564 states and 4948 transitions. [2024-11-07 03:35:18,017 INFO L78 Accepts]: Start accepts. Automaton has 3564 states and 4948 transitions. Word has length 257 [2024-11-07 03:35:18,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:18,017 INFO L471 AbstractCegarLoop]: Abstraction has 3564 states and 4948 transitions. [2024-11-07 03:35:18,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.77777777777778) internal successors, (250), 9 states have internal predecessors, (250), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:18,017 INFO L276 IsEmpty]: Start isEmpty. Operand 3564 states and 4948 transitions. [2024-11-07 03:35:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:18,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:18,020 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:18,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-07 03:35:18,020 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:18,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1283637439, now seen corresponding path program 1 times [2024-11-07 03:35:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:18,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239636151] [2024-11-07 03:35:18,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:18,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:18,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239636151] [2024-11-07 03:35:18,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239636151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:18,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:18,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:18,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048953245] [2024-11-07 03:35:18,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:18,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:18,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:18,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:18,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:18,279 INFO L87 Difference]: Start difference. First operand 3564 states and 4948 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:18,317 INFO L93 Difference]: Finished difference Result 6006 states and 8338 transitions. [2024-11-07 03:35:18,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:18,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:18,321 INFO L225 Difference]: With dead ends: 6006 [2024-11-07 03:35:18,321 INFO L226 Difference]: Without dead ends: 3612 [2024-11-07 03:35:18,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:18,324 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:18,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3886 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:18,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2024-11-07 03:35:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3600. [2024-11-07 03:35:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3600 states, 3574 states have (on average 1.3810856183547846) internal successors, (4936), 3574 states have internal predecessors, (4936), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 4984 transitions. [2024-11-07 03:35:18,358 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 4984 transitions. Word has length 258 [2024-11-07 03:35:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:18,359 INFO L471 AbstractCegarLoop]: Abstraction has 3600 states and 4984 transitions. [2024-11-07 03:35:18,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:18,359 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 4984 transitions. [2024-11-07 03:35:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:18,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:18,361 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-07 03:35:18,361 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:18,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:18,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1579912869, now seen corresponding path program 1 times [2024-11-07 03:35:18,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:18,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644873597] [2024-11-07 03:35:18,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:18,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:18,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:18,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:18,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644873597] [2024-11-07 03:35:18,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644873597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:18,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:18,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:35:18,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111754934] [2024-11-07 03:35:18,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:18,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:35:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:18,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:35:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:18,647 INFO L87 Difference]: Start difference. First operand 3600 states and 4984 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:18,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:18,675 INFO L93 Difference]: Finished difference Result 5931 states and 8245 transitions. [2024-11-07 03:35:18,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:35:18,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:18,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:18,679 INFO L225 Difference]: With dead ends: 5931 [2024-11-07 03:35:18,679 INFO L226 Difference]: Without dead ends: 3636 [2024-11-07 03:35:18,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:18,681 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:18,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2926 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:18,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3636 states. [2024-11-07 03:35:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3636 to 3636. [2024-11-07 03:35:18,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3636 states, 3610 states have (on average 1.3772853185595568) internal successors, (4972), 3610 states have internal predecessors, (4972), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:18,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3636 states to 3636 states and 5020 transitions. [2024-11-07 03:35:18,712 INFO L78 Accepts]: Start accepts. Automaton has 3636 states and 5020 transitions. Word has length 258 [2024-11-07 03:35:18,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:18,712 INFO L471 AbstractCegarLoop]: Abstraction has 3636 states and 5020 transitions. [2024-11-07 03:35:18,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:18,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3636 states and 5020 transitions. [2024-11-07 03:35:18,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:18,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:18,715 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:18,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-11-07 03:35:18,715 INFO L396 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:18,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:18,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1136335807, now seen corresponding path program 1 times [2024-11-07 03:35:18,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:18,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249409326] [2024-11-07 03:35:18,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:18,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:18,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:18,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:18,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:18,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249409326] [2024-11-07 03:35:18,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249409326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916570657] [2024-11-07 03:35:18,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:18,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:18,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:18,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:18,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:18,948 INFO L87 Difference]: Start difference. First operand 3636 states and 5020 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:18,986 INFO L93 Difference]: Finished difference Result 5862 states and 8140 transitions. [2024-11-07 03:35:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:18,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:18,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:18,990 INFO L225 Difference]: With dead ends: 5862 [2024-11-07 03:35:18,990 INFO L226 Difference]: Without dead ends: 3684 [2024-11-07 03:35:18,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:35:18,993 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2912 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3886 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:18,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3886 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:18,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3684 states. [2024-11-07 03:35:19,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3684 to 3672. [2024-11-07 03:35:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 3646 states have (on average 1.3735600658255622) internal successors, (5008), 3646 states have internal predecessors, (5008), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:19,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 5056 transitions. [2024-11-07 03:35:19,026 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 5056 transitions. Word has length 258 [2024-11-07 03:35:19,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:19,026 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 5056 transitions. [2024-11-07 03:35:19,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:19,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 5056 transitions. [2024-11-07 03:35:19,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:19,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:19,029 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:19,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2024-11-07 03:35:19,029 INFO L396 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:19,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:19,029 INFO L85 PathProgramCache]: Analyzing trace with hash -530319681, now seen corresponding path program 1 times [2024-11-07 03:35:19,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:19,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165665827] [2024-11-07 03:35:19,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:19,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165665827] [2024-11-07 03:35:19,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165665827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814435630] [2024-11-07 03:35:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:19,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:19,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:19,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:19,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:19,285 INFO L87 Difference]: Start difference. First operand 3672 states and 5056 transitions. Second operand has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:19,326 INFO L93 Difference]: Finished difference Result 5728 states and 7962 transitions. [2024-11-07 03:35:19,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:19,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:19,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:19,330 INFO L225 Difference]: With dead ends: 5728 [2024-11-07 03:35:19,330 INFO L226 Difference]: Without dead ends: 3712 [2024-11-07 03:35:19,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:19,332 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 2 mSDsluCounter, 2911 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3885 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:19,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3885 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:19,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2024-11-07 03:35:19,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3704. [2024-11-07 03:35:19,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3704 states, 3678 states have (on average 1.372485046220772) internal successors, (5048), 3678 states have internal predecessors, (5048), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:19,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3704 states to 3704 states and 5096 transitions. [2024-11-07 03:35:19,364 INFO L78 Accepts]: Start accepts. Automaton has 3704 states and 5096 transitions. Word has length 258 [2024-11-07 03:35:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:19,364 INFO L471 AbstractCegarLoop]: Abstraction has 3704 states and 5096 transitions. [2024-11-07 03:35:19,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.2) internal successors, (251), 5 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3704 states and 5096 transitions. [2024-11-07 03:35:19,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:19,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:19,367 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:19,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2024-11-07 03:35:19,367 INFO L396 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:19,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:19,368 INFO L85 PathProgramCache]: Analyzing trace with hash 779867739, now seen corresponding path program 1 times [2024-11-07 03:35:19,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:19,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585092775] [2024-11-07 03:35:19,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:19,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:19,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:19,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:19,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585092775] [2024-11-07 03:35:19,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585092775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:19,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:19,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:35:19,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487834511] [2024-11-07 03:35:19,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:19,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:35:19,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:19,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:35:19,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:19,643 INFO L87 Difference]: Start difference. First operand 3704 states and 5096 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:19,671 INFO L93 Difference]: Finished difference Result 5863 states and 8139 transitions. [2024-11-07 03:35:19,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:35:19,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:19,674 INFO L225 Difference]: With dead ends: 5863 [2024-11-07 03:35:19,674 INFO L226 Difference]: Without dead ends: 3740 [2024-11-07 03:35:19,676 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:19,676 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:19,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2926 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:19,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2024-11-07 03:35:19,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3740. [2024-11-07 03:35:19,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3740 states, 3714 states have (on average 1.3688745288099085) internal successors, (5084), 3714 states have internal predecessors, (5084), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3740 states to 3740 states and 5132 transitions. [2024-11-07 03:35:19,705 INFO L78 Accepts]: Start accepts. Automaton has 3740 states and 5132 transitions. Word has length 258 [2024-11-07 03:35:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:19,705 INFO L471 AbstractCegarLoop]: Abstraction has 3740 states and 5132 transitions. [2024-11-07 03:35:19,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 3740 states and 5132 transitions. [2024-11-07 03:35:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:19,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:19,707 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:19,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2024-11-07 03:35:19,708 INFO L396 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:19,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:19,708 INFO L85 PathProgramCache]: Analyzing trace with hash 639405147, now seen corresponding path program 1 times [2024-11-07 03:35:19,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:19,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029814490] [2024-11-07 03:35:19,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:19,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:19,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:19,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:19,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029814490] [2024-11-07 03:35:19,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029814490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:19,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:19,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:35:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095843195] [2024-11-07 03:35:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:19,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:35:19,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:19,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:35:19,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:19,971 INFO L87 Difference]: Start difference. First operand 3740 states and 5132 transitions. Second operand has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:20,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:20,004 INFO L93 Difference]: Finished difference Result 6472 states and 8856 transitions. [2024-11-07 03:35:20,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:35:20,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:20,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:20,008 INFO L225 Difference]: With dead ends: 6472 [2024-11-07 03:35:20,008 INFO L226 Difference]: Without dead ends: 3776 [2024-11-07 03:35:20,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:20,010 INFO L432 NwaCegarLoop]: 978 mSDtfsCounter, 0 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2926 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:20,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2926 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3776 states. [2024-11-07 03:35:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3776 to 3776. [2024-11-07 03:35:20,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3776 states, 3750 states have (on average 1.3653333333333333) internal successors, (5120), 3750 states have internal predecessors, (5120), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3776 states to 3776 states and 5168 transitions. [2024-11-07 03:35:20,042 INFO L78 Accepts]: Start accepts. Automaton has 3776 states and 5168 transitions. Word has length 258 [2024-11-07 03:35:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:20,042 INFO L471 AbstractCegarLoop]: Abstraction has 3776 states and 5168 transitions. [2024-11-07 03:35:20,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:20,042 INFO L276 IsEmpty]: Start isEmpty. Operand 3776 states and 5168 transitions. [2024-11-07 03:35:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:20,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:20,044 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:20,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2024-11-07 03:35:20,044 INFO L396 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:20,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:20,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1160964446, now seen corresponding path program 1 times [2024-11-07 03:35:20,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:20,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707068610] [2024-11-07 03:35:20,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:20,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:20,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:20,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:20,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707068610] [2024-11-07 03:35:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707068610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:20,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:20,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:20,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407870434] [2024-11-07 03:35:20,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:20,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:20,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:20,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:20,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:20,433 INFO L87 Difference]: Start difference. First operand 3776 states and 5168 transitions. Second operand has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:20,641 INFO L93 Difference]: Finished difference Result 6491 states and 9001 transitions. [2024-11-07 03:35:20,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:35:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:20,646 INFO L225 Difference]: With dead ends: 6491 [2024-11-07 03:35:20,646 INFO L226 Difference]: Without dead ends: 4556 [2024-11-07 03:35:20,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:20,649 INFO L432 NwaCegarLoop]: 959 mSDtfsCounter, 2512 mSDsluCounter, 5728 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2514 SdHoareTripleChecker+Valid, 6687 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:20,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2514 Valid, 6687 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:20,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4556 states. [2024-11-07 03:35:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4556 to 3780. [2024-11-07 03:35:20,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3754 states have (on average 1.3649440596696856) internal successors, (5124), 3754 states have internal predecessors, (5124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:20,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5172 transitions. [2024-11-07 03:35:20,684 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5172 transitions. Word has length 258 [2024-11-07 03:35:20,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:20,684 INFO L471 AbstractCegarLoop]: Abstraction has 3780 states and 5172 transitions. [2024-11-07 03:35:20,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.88888888888889) internal successors, (251), 9 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:20,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5172 transitions. [2024-11-07 03:35:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 03:35:20,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:20,686 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:20,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2024-11-07 03:35:20,686 INFO L396 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:20,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:20,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1322336361, now seen corresponding path program 1 times [2024-11-07 03:35:20,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:20,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558363482] [2024-11-07 03:35:20,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:20,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:20,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:21,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:21,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:21,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558363482] [2024-11-07 03:35:21,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558363482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:21,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:21,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:21,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912103454] [2024-11-07 03:35:21,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:21,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:21,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:21,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:21,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:21,177 INFO L87 Difference]: Start difference. First operand 3780 states and 5172 transitions. Second operand has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:21,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:21,396 INFO L93 Difference]: Finished difference Result 5347 states and 7401 transitions. [2024-11-07 03:35:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 258 [2024-11-07 03:35:21,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:21,400 INFO L225 Difference]: With dead ends: 5347 [2024-11-07 03:35:21,400 INFO L226 Difference]: Without dead ends: 3800 [2024-11-07 03:35:21,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:35:21,403 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 1199 mSDsluCounter, 3546 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 4443 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:21,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 4443 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3800 states. [2024-11-07 03:35:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3800 to 3696. [2024-11-07 03:35:21,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3696 states, 3670 states have (on average 1.36566757493188) internal successors, (5012), 3670 states have internal predecessors, (5012), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:21,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5060 transitions. [2024-11-07 03:35:21,439 INFO L78 Accepts]: Start accepts. Automaton has 3696 states and 5060 transitions. Word has length 258 [2024-11-07 03:35:21,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:21,439 INFO L471 AbstractCegarLoop]: Abstraction has 3696 states and 5060 transitions. [2024-11-07 03:35:21,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 35.857142857142854) internal successors, (251), 7 states have internal predecessors, (251), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:21,439 INFO L276 IsEmpty]: Start isEmpty. Operand 3696 states and 5060 transitions. [2024-11-07 03:35:21,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-07 03:35:21,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:21,442 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74 [2024-11-07 03:35:21,442 INFO L396 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:21,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1463720835, now seen corresponding path program 1 times [2024-11-07 03:35:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:21,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848197370] [2024-11-07 03:35:21,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:21,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:21,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:21,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:21,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:21,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:21,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848197370] [2024-11-07 03:35:21,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848197370] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:21,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:21,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960667805] [2024-11-07 03:35:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:21,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:21,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:21,906 INFO L87 Difference]: Start difference. First operand 3696 states and 5060 transitions. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:22,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:22,105 INFO L93 Difference]: Finished difference Result 5655 states and 7827 transitions. [2024-11-07 03:35:22,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:35:22,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 259 [2024-11-07 03:35:22,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:22,109 INFO L225 Difference]: With dead ends: 5655 [2024-11-07 03:35:22,109 INFO L226 Difference]: Without dead ends: 3696 [2024-11-07 03:35:22,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:22,111 INFO L432 NwaCegarLoop]: 892 mSDtfsCounter, 1598 mSDsluCounter, 2723 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 3615 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:22,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 3615 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:22,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3696 states. [2024-11-07 03:35:22,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3696 to 3648. [2024-11-07 03:35:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 3622 states have (on average 1.3638873550524573) internal successors, (4940), 3622 states have internal predecessors, (4940), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4988 transitions. [2024-11-07 03:35:22,143 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4988 transitions. Word has length 259 [2024-11-07 03:35:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:22,143 INFO L471 AbstractCegarLoop]: Abstraction has 3648 states and 4988 transitions. [2024-11-07 03:35:22,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4988 transitions. [2024-11-07 03:35:22,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-07 03:35:22,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:22,146 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:22,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75 [2024-11-07 03:35:22,146 INFO L396 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:22,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:22,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1290973441, now seen corresponding path program 1 times [2024-11-07 03:35:22,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:22,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95906772] [2024-11-07 03:35:22,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:22,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:22,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:22,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:22,627 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:22,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:22,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95906772] [2024-11-07 03:35:22,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95906772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:22,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:22,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197246828] [2024-11-07 03:35:22,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:22,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:22,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:22,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:22,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:22,628 INFO L87 Difference]: Start difference. First operand 3648 states and 4988 transitions. Second operand has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:22,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:22,805 INFO L93 Difference]: Finished difference Result 5341 states and 7383 transitions. [2024-11-07 03:35:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 260 [2024-11-07 03:35:22,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:22,808 INFO L225 Difference]: With dead ends: 5341 [2024-11-07 03:35:22,809 INFO L226 Difference]: Without dead ends: 3754 [2024-11-07 03:35:22,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:22,810 INFO L432 NwaCegarLoop]: 952 mSDtfsCounter, 1483 mSDsluCounter, 5664 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 6616 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:22,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 6616 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:22,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3754 states. [2024-11-07 03:35:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3754 to 3690. [2024-11-07 03:35:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3664 states have (on average 1.362991266375546) internal successors, (4994), 3664 states have internal predecessors, (4994), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:22,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 5042 transitions. [2024-11-07 03:35:22,841 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 5042 transitions. Word has length 260 [2024-11-07 03:35:22,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:22,841 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 5042 transitions. [2024-11-07 03:35:22,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.11111111111111) internal successors, (253), 9 states have internal predecessors, (253), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:22,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 5042 transitions. [2024-11-07 03:35:22,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2024-11-07 03:35:22,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:22,844 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:22,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2024-11-07 03:35:22,844 INFO L396 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:22,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:22,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1362649992, now seen corresponding path program 1 times [2024-11-07 03:35:22,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:22,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180972944] [2024-11-07 03:35:22,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:22,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:23,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:23,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:23,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:23,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180972944] [2024-11-07 03:35:23,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180972944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:23,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:23,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:23,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820626834] [2024-11-07 03:35:23,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:23,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:23,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:23,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:23,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:23,432 INFO L87 Difference]: Start difference. First operand 3690 states and 5042 transitions. Second operand has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:23,830 INFO L93 Difference]: Finished difference Result 5321 states and 7355 transitions. [2024-11-07 03:35:23,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 03:35:23,831 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 260 [2024-11-07 03:35:23,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:23,835 INFO L225 Difference]: With dead ends: 5321 [2024-11-07 03:35:23,835 INFO L226 Difference]: Without dead ends: 3702 [2024-11-07 03:35:23,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-07 03:35:23,837 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 1806 mSDsluCounter, 7181 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 8100 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:23,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1808 Valid, 8100 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:35:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2024-11-07 03:35:23,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3694. [2024-11-07 03:35:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3694 states, 3668 states have (on average 1.3625954198473282) internal successors, (4998), 3668 states have internal predecessors, (4998), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3694 states to 3694 states and 5046 transitions. [2024-11-07 03:35:23,871 INFO L78 Accepts]: Start accepts. Automaton has 3694 states and 5046 transitions. Word has length 260 [2024-11-07 03:35:23,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:23,871 INFO L471 AbstractCegarLoop]: Abstraction has 3694 states and 5046 transitions. [2024-11-07 03:35:23,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.0) internal successors, (253), 11 states have internal predecessors, (253), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:23,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3694 states and 5046 transitions. [2024-11-07 03:35:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-07 03:35:23,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:23,874 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:23,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77 [2024-11-07 03:35:23,874 INFO L396 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:23,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1851894125, now seen corresponding path program 1 times [2024-11-07 03:35:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:23,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739561581] [2024-11-07 03:35:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:24,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:24,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:24,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:24,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:24,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739561581] [2024-11-07 03:35:24,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739561581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:24,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:24,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:24,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442875502] [2024-11-07 03:35:24,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:24,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:24,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:24,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:24,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:24,120 INFO L87 Difference]: Start difference. First operand 3694 states and 5046 transitions. Second operand has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:24,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:24,162 INFO L93 Difference]: Finished difference Result 5289 states and 7309 transitions. [2024-11-07 03:35:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:24,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-11-07 03:35:24,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:24,167 INFO L225 Difference]: With dead ends: 5289 [2024-11-07 03:35:24,167 INFO L226 Difference]: Without dead ends: 3710 [2024-11-07 03:35:24,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:24,169 INFO L432 NwaCegarLoop]: 973 mSDtfsCounter, 2 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3881 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:24,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3881 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3710 states. [2024-11-07 03:35:24,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3710 to 3706. [2024-11-07 03:35:24,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3706 states, 3680 states have (on average 1.3619565217391305) internal successors, (5012), 3680 states have internal predecessors, (5012), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:24,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3706 states to 3706 states and 5060 transitions. [2024-11-07 03:35:24,205 INFO L78 Accepts]: Start accepts. Automaton has 3706 states and 5060 transitions. Word has length 261 [2024-11-07 03:35:24,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:24,205 INFO L471 AbstractCegarLoop]: Abstraction has 3706 states and 5060 transitions. [2024-11-07 03:35:24,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:24,205 INFO L276 IsEmpty]: Start isEmpty. Operand 3706 states and 5060 transitions. [2024-11-07 03:35:24,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2024-11-07 03:35:24,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:24,208 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:24,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2024-11-07 03:35:24,208 INFO L396 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:24,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:24,208 INFO L85 PathProgramCache]: Analyzing trace with hash 413434633, now seen corresponding path program 1 times [2024-11-07 03:35:24,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:24,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339196701] [2024-11-07 03:35:24,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:24,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:24,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:24,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:24,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:24,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:24,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:24,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339196701] [2024-11-07 03:35:24,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339196701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:24,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:24,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:35:24,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260524440] [2024-11-07 03:35:24,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:24,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:35:24,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:24,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:35:24,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:24,522 INFO L87 Difference]: Start difference. First operand 3706 states and 5060 transitions. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:24,557 INFO L93 Difference]: Finished difference Result 5333 states and 7365 transitions. [2024-11-07 03:35:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:35:24,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 261 [2024-11-07 03:35:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:24,562 INFO L225 Difference]: With dead ends: 5333 [2024-11-07 03:35:24,562 INFO L226 Difference]: Without dead ends: 3724 [2024-11-07 03:35:24,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:24,564 INFO L432 NwaCegarLoop]: 976 mSDtfsCounter, 0 mSDsluCounter, 1944 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:24,564 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2920 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2024-11-07 03:35:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3724. [2024-11-07 03:35:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3724 states, 3698 states have (on average 1.3607355327203894) internal successors, (5032), 3698 states have internal predecessors, (5032), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3724 states to 3724 states and 5080 transitions. [2024-11-07 03:35:24,603 INFO L78 Accepts]: Start accepts. Automaton has 3724 states and 5080 transitions. Word has length 261 [2024-11-07 03:35:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:24,603 INFO L471 AbstractCegarLoop]: Abstraction has 3724 states and 5080 transitions. [2024-11-07 03:35:24,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 3724 states and 5080 transitions. [2024-11-07 03:35:24,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-07 03:35:24,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:24,606 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:24,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable79 [2024-11-07 03:35:24,606 INFO L396 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:24,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:24,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1171780861, now seen corresponding path program 1 times [2024-11-07 03:35:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:24,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434464508] [2024-11-07 03:35:24,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:24,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:24,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:25,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:25,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:25,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434464508] [2024-11-07 03:35:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434464508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:25,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:25,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:25,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812570603] [2024-11-07 03:35:25,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:25,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:25,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:25,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:25,100 INFO L87 Difference]: Start difference. First operand 3724 states and 5080 transitions. Second operand has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:25,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:25,258 INFO L93 Difference]: Finished difference Result 5545 states and 7641 transitions. [2024-11-07 03:35:25,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:25,258 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 262 [2024-11-07 03:35:25,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:25,262 INFO L225 Difference]: With dead ends: 5545 [2024-11-07 03:35:25,262 INFO L226 Difference]: Without dead ends: 3798 [2024-11-07 03:35:25,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:25,265 INFO L432 NwaCegarLoop]: 952 mSDtfsCounter, 1558 mSDsluCounter, 5668 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 6620 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:25,265 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 6620 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3798 states. [2024-11-07 03:35:25,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3798 to 3728. [2024-11-07 03:35:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3728 states, 3702 states have (on average 1.3603457590491626) internal successors, (5036), 3702 states have internal predecessors, (5036), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3728 states to 3728 states and 5084 transitions. [2024-11-07 03:35:25,300 INFO L78 Accepts]: Start accepts. Automaton has 3728 states and 5084 transitions. Word has length 262 [2024-11-07 03:35:25,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:25,300 INFO L471 AbstractCegarLoop]: Abstraction has 3728 states and 5084 transitions. [2024-11-07 03:35:25,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.333333333333332) internal successors, (255), 9 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3728 states and 5084 transitions. [2024-11-07 03:35:25,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-07 03:35:25,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:25,303 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:25,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80 [2024-11-07 03:35:25,303 INFO L396 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:25,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1650545599, now seen corresponding path program 1 times [2024-11-07 03:35:25,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:25,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461298812] [2024-11-07 03:35:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:25,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:35:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:25,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:35:25,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:25,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:25,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461298812] [2024-11-07 03:35:25,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461298812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:25,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:25,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:35:25,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322080695] [2024-11-07 03:35:25,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:25,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:35:25,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:25,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:35:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:25,735 INFO L87 Difference]: Start difference. First operand 3728 states and 5084 transitions. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:25,815 INFO L93 Difference]: Finished difference Result 6701 states and 9083 transitions. [2024-11-07 03:35:25,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:35:25,815 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 262 [2024-11-07 03:35:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:25,820 INFO L225 Difference]: With dead ends: 6701 [2024-11-07 03:35:25,820 INFO L226 Difference]: Without dead ends: 3780 [2024-11-07 03:35:25,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:25,823 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 1 mSDsluCounter, 4829 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 5803 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:25,823 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 5803 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:25,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2024-11-07 03:35:25,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 3780. [2024-11-07 03:35:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3780 states, 3754 states have (on average 1.357485348961108) internal successors, (5096), 3754 states have internal predecessors, (5096), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3780 states to 3780 states and 5144 transitions. [2024-11-07 03:35:25,862 INFO L78 Accepts]: Start accepts. Automaton has 3780 states and 5144 transitions. Word has length 262 [2024-11-07 03:35:25,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:25,863 INFO L471 AbstractCegarLoop]: Abstraction has 3780 states and 5144 transitions. [2024-11-07 03:35:25,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3780 states and 5144 transitions. [2024-11-07 03:35:25,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2024-11-07 03:35:25,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:25,865 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:25,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81 [2024-11-07 03:35:25,866 INFO L396 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:25,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:25,866 INFO L85 PathProgramCache]: Analyzing trace with hash 832511448, now seen corresponding path program 1 times [2024-11-07 03:35:25,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:25,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80413473] [2024-11-07 03:35:25,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:25,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:26,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:35:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:26,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:35:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:26,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80413473] [2024-11-07 03:35:26,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80413473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:26,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:26,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:35:26,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840896388] [2024-11-07 03:35:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:26,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:35:26,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:26,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:35:26,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:35:26,232 INFO L87 Difference]: Start difference. First operand 3780 states and 5144 transitions. Second operand has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:26,368 INFO L93 Difference]: Finished difference Result 5828 states and 8016 transitions. [2024-11-07 03:35:26,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:35:26,369 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 262 [2024-11-07 03:35:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:26,373 INFO L225 Difference]: With dead ends: 5828 [2024-11-07 03:35:26,373 INFO L226 Difference]: Without dead ends: 3812 [2024-11-07 03:35:26,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:26,376 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 872 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 3759 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:26,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 3759 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2024-11-07 03:35:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3796. [2024-11-07 03:35:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3796 states, 3770 states have (on average 1.353846153846154) internal successors, (5104), 3770 states have internal predecessors, (5104), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:26,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 5152 transitions. [2024-11-07 03:35:26,415 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 5152 transitions. Word has length 262 [2024-11-07 03:35:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:26,415 INFO L471 AbstractCegarLoop]: Abstraction has 3796 states and 5152 transitions. [2024-11-07 03:35:26,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.5) internal successors, (255), 6 states have internal predecessors, (255), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 5152 transitions. [2024-11-07 03:35:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2024-11-07 03:35:26,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:26,418 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:26,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2024-11-07 03:35:26,418 INFO L396 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:26,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:26,418 INFO L85 PathProgramCache]: Analyzing trace with hash 182783486, now seen corresponding path program 1 times [2024-11-07 03:35:26,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:26,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662999579] [2024-11-07 03:35:26,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:26,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:26,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:35:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:35:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:26,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:26,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:26,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662999579] [2024-11-07 03:35:26,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662999579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:26,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:26,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:26,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470054988] [2024-11-07 03:35:26,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:26,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:26,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:26,688 INFO L87 Difference]: Start difference. First operand 3796 states and 5152 transitions. Second operand has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:26,732 INFO L93 Difference]: Finished difference Result 5796 states and 7948 transitions. [2024-11-07 03:35:26,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:26,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 263 [2024-11-07 03:35:26,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:26,736 INFO L225 Difference]: With dead ends: 5796 [2024-11-07 03:35:26,736 INFO L226 Difference]: Without dead ends: 3828 [2024-11-07 03:35:26,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:35:26,739 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 2 mSDsluCounter, 2903 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3874 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:26,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3874 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:26,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3828 states. [2024-11-07 03:35:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3828 to 3820. [2024-11-07 03:35:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3820 states, 3794 states have (on average 1.3521349499209279) internal successors, (5130), 3794 states have internal predecessors, (5130), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 5178 transitions. [2024-11-07 03:35:26,774 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 5178 transitions. Word has length 263 [2024-11-07 03:35:26,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:26,774 INFO L471 AbstractCegarLoop]: Abstraction has 3820 states and 5178 transitions. [2024-11-07 03:35:26,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.2) internal successors, (256), 5 states have internal predecessors, (256), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 5178 transitions. [2024-11-07 03:35:26,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 03:35:26,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:26,777 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:26,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83 [2024-11-07 03:35:26,777 INFO L396 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1719289394, now seen corresponding path program 1 times [2024-11-07 03:35:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:26,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183061474] [2024-11-07 03:35:26,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:26,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:27,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:35:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 03:35:27,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:27,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:27,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183061474] [2024-11-07 03:35:27,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183061474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:27,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:27,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:27,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050334792] [2024-11-07 03:35:27,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:27,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:27,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:27,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:27,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:27,279 INFO L87 Difference]: Start difference. First operand 3820 states and 5178 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:27,452 INFO L93 Difference]: Finished difference Result 5484 states and 7526 transitions. [2024-11-07 03:35:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:27,453 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 264 [2024-11-07 03:35:27,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:27,457 INFO L225 Difference]: With dead ends: 5484 [2024-11-07 03:35:27,457 INFO L226 Difference]: Without dead ends: 3894 [2024-11-07 03:35:27,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:27,459 INFO L432 NwaCegarLoop]: 951 mSDtfsCounter, 1290 mSDsluCounter, 5682 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 6633 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:27,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 6633 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:27,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3894 states. [2024-11-07 03:35:27,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3894 to 3862. [2024-11-07 03:35:27,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3862 states, 3836 states have (on average 1.35140771637122) internal successors, (5184), 3836 states have internal predecessors, (5184), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 5232 transitions. [2024-11-07 03:35:27,495 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 5232 transitions. Word has length 264 [2024-11-07 03:35:27,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:27,496 INFO L471 AbstractCegarLoop]: Abstraction has 3862 states and 5232 transitions. [2024-11-07 03:35:27,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:27,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 5232 transitions. [2024-11-07 03:35:27,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 03:35:27,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:27,499 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:27,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84 [2024-11-07 03:35:27,499 INFO L396 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:27,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:27,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1583583444, now seen corresponding path program 1 times [2024-11-07 03:35:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:27,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980688433] [2024-11-07 03:35:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:35:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:35:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:27,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:27,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980688433] [2024-11-07 03:35:27,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980688433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:27,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:35:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232636569] [2024-11-07 03:35:27,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:27,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:35:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:35:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:35:27,782 INFO L87 Difference]: Start difference. First operand 3862 states and 5232 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:27,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:27,901 INFO L93 Difference]: Finished difference Result 5918 states and 8098 transitions. [2024-11-07 03:35:27,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:35:27,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 264 [2024-11-07 03:35:27,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:27,906 INFO L225 Difference]: With dead ends: 5918 [2024-11-07 03:35:27,906 INFO L226 Difference]: Without dead ends: 3878 [2024-11-07 03:35:27,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:27,910 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 870 mSDsluCounter, 2818 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 3759 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:27,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 3759 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:27,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3878 states. [2024-11-07 03:35:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3878 to 3870. [2024-11-07 03:35:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3870 states, 3844 states have (on average 1.3506763787721123) internal successors, (5192), 3844 states have internal predecessors, (5192), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3870 states to 3870 states and 5240 transitions. [2024-11-07 03:35:27,945 INFO L78 Accepts]: Start accepts. Automaton has 3870 states and 5240 transitions. Word has length 264 [2024-11-07 03:35:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:27,945 INFO L471 AbstractCegarLoop]: Abstraction has 3870 states and 5240 transitions. [2024-11-07 03:35:27,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 3870 states and 5240 transitions. [2024-11-07 03:35:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 03:35:27,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:27,948 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:27,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85 [2024-11-07 03:35:27,948 INFO L396 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:27,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:27,948 INFO L85 PathProgramCache]: Analyzing trace with hash -15514955, now seen corresponding path program 1 times [2024-11-07 03:35:27,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:27,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533894845] [2024-11-07 03:35:27,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:27,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:28,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 03:35:28,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:35:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:28,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:28,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:28,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533894845] [2024-11-07 03:35:28,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533894845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:28,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:28,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:28,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528760088] [2024-11-07 03:35:28,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:28,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:28,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:28,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:28,578 INFO L87 Difference]: Start difference. First operand 3870 states and 5240 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:28,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:28,986 INFO L93 Difference]: Finished difference Result 5788 states and 7918 transitions. [2024-11-07 03:35:28,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:28,987 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 264 [2024-11-07 03:35:28,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:28,991 INFO L225 Difference]: With dead ends: 5788 [2024-11-07 03:35:28,991 INFO L226 Difference]: Without dead ends: 4020 [2024-11-07 03:35:28,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:28,994 INFO L432 NwaCegarLoop]: 1216 mSDtfsCounter, 1290 mSDsluCounter, 6875 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 8091 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:28,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 8091 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:35:28,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2024-11-07 03:35:29,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 3874. [2024-11-07 03:35:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3874 states, 3848 states have (on average 1.3503118503118503) internal successors, (5196), 3848 states have internal predecessors, (5196), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:29,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3874 states to 3874 states and 5244 transitions. [2024-11-07 03:35:29,028 INFO L78 Accepts]: Start accepts. Automaton has 3874 states and 5244 transitions. Word has length 264 [2024-11-07 03:35:29,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:29,029 INFO L471 AbstractCegarLoop]: Abstraction has 3874 states and 5244 transitions. [2024-11-07 03:35:29,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3874 states and 5244 transitions. [2024-11-07 03:35:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 03:35:29,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:29,031 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:29,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable86 [2024-11-07 03:35:29,031 INFO L396 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2042081670, now seen corresponding path program 1 times [2024-11-07 03:35:29,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:29,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247101325] [2024-11-07 03:35:29,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:29,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:29,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:29,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:29,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247101325] [2024-11-07 03:35:29,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247101325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:29,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:29,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438252743] [2024-11-07 03:35:29,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:29,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:29,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:29,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:29,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:29,295 INFO L87 Difference]: Start difference. First operand 3874 states and 5244 transitions. Second operand has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:29,351 INFO L93 Difference]: Finished difference Result 6542 states and 8849 transitions. [2024-11-07 03:35:29,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:29,352 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 264 [2024-11-07 03:35:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:29,355 INFO L225 Difference]: With dead ends: 6542 [2024-11-07 03:35:29,355 INFO L226 Difference]: Without dead ends: 3898 [2024-11-07 03:35:29,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:35:29,358 INFO L432 NwaCegarLoop]: 968 mSDtfsCounter, 899 mSDsluCounter, 1933 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:29,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 2901 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3898 states. [2024-11-07 03:35:29,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3898 to 3886. [2024-11-07 03:35:29,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3886 states, 3860 states have (on average 1.3492227979274611) internal successors, (5208), 3860 states have internal predecessors, (5208), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 5256 transitions. [2024-11-07 03:35:29,392 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 5256 transitions. Word has length 264 [2024-11-07 03:35:29,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:29,392 INFO L471 AbstractCegarLoop]: Abstraction has 3886 states and 5256 transitions. [2024-11-07 03:35:29,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.4) internal successors, (257), 5 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:29,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 5256 transitions. [2024-11-07 03:35:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 03:35:29,394 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:29,395 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:29,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable87 [2024-11-07 03:35:29,395 INFO L396 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:29,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1734414446, now seen corresponding path program 1 times [2024-11-07 03:35:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151741774] [2024-11-07 03:35:29,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:29,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:29,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:29,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:29,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:29,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:29,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:29,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151741774] [2024-11-07 03:35:29,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151741774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:29,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:29,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903267329] [2024-11-07 03:35:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:29,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:29,784 INFO L87 Difference]: Start difference. First operand 3886 states and 5256 transitions. Second operand has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:29,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:29,956 INFO L93 Difference]: Finished difference Result 6660 states and 9130 transitions. [2024-11-07 03:35:29,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:35:29,957 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 264 [2024-11-07 03:35:29,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:29,962 INFO L225 Difference]: With dead ends: 6660 [2024-11-07 03:35:29,962 INFO L226 Difference]: Without dead ends: 4759 [2024-11-07 03:35:29,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:29,965 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 1773 mSDsluCounter, 5728 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 6685 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:29,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 6685 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2024-11-07 03:35:29,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 3890. [2024-11-07 03:35:30,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3890 states, 3864 states have (on average 1.3488612836438922) internal successors, (5212), 3864 states have internal predecessors, (5212), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3890 states to 3890 states and 5260 transitions. [2024-11-07 03:35:30,005 INFO L78 Accepts]: Start accepts. Automaton has 3890 states and 5260 transitions. Word has length 264 [2024-11-07 03:35:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:30,005 INFO L471 AbstractCegarLoop]: Abstraction has 3890 states and 5260 transitions. [2024-11-07 03:35:30,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.555555555555557) internal successors, (257), 9 states have internal predecessors, (257), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states and 5260 transitions. [2024-11-07 03:35:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 03:35:30,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:30,007 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:30,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable88 [2024-11-07 03:35:30,008 INFO L396 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:30,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:30,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1327023139, now seen corresponding path program 1 times [2024-11-07 03:35:30,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:30,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941901588] [2024-11-07 03:35:30,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:30,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:30,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:30,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:30,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:30,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941901588] [2024-11-07 03:35:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941901588] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:30,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 03:35:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838433504] [2024-11-07 03:35:30,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 03:35:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:30,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 03:35:30,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-07 03:35:30,556 INFO L87 Difference]: Start difference. First operand 3890 states and 5260 transitions. Second operand has 12 states, 12 states have (on average 21.416666666666668) internal successors, (257), 12 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:30,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:30,944 INFO L93 Difference]: Finished difference Result 6396 states and 8679 transitions. [2024-11-07 03:35:30,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 03:35:30,945 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 21.416666666666668) internal successors, (257), 12 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 264 [2024-11-07 03:35:30,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:30,949 INFO L225 Difference]: With dead ends: 6396 [2024-11-07 03:35:30,949 INFO L226 Difference]: Without dead ends: 4768 [2024-11-07 03:35:30,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2024-11-07 03:35:30,952 INFO L432 NwaCegarLoop]: 1082 mSDtfsCounter, 1807 mSDsluCounter, 8373 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1809 SdHoareTripleChecker+Valid, 9455 SdHoareTripleChecker+Invalid, 706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:30,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1809 Valid, 9455 Invalid, 706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:35:30,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4768 states. [2024-11-07 03:35:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4768 to 4370. [2024-11-07 03:35:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4370 states, 4344 states have (on average 1.339779005524862) internal successors, (5820), 4344 states have internal predecessors, (5820), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4370 states to 4370 states and 5868 transitions. [2024-11-07 03:35:30,990 INFO L78 Accepts]: Start accepts. Automaton has 4370 states and 5868 transitions. Word has length 264 [2024-11-07 03:35:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:30,990 INFO L471 AbstractCegarLoop]: Abstraction has 4370 states and 5868 transitions. [2024-11-07 03:35:30,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 21.416666666666668) internal successors, (257), 12 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 4370 states and 5868 transitions. [2024-11-07 03:35:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2024-11-07 03:35:30,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:30,993 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:30,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89 [2024-11-07 03:35:30,993 INFO L396 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:30,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:30,993 INFO L85 PathProgramCache]: Analyzing trace with hash -969873459, now seen corresponding path program 1 times [2024-11-07 03:35:30,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:30,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715031372] [2024-11-07 03:35:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:30,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:31,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:31,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:31,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:31,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:31,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715031372] [2024-11-07 03:35:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715031372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:31,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:31,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:31,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772756022] [2024-11-07 03:35:31,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:31,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:31,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:31,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:31,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:31,712 INFO L87 Difference]: Start difference. First operand 4370 states and 5868 transitions. Second operand has 11 states, 11 states have (on average 23.363636363636363) internal successors, (257), 11 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:32,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:32,080 INFO L93 Difference]: Finished difference Result 6872 states and 9316 transitions. [2024-11-07 03:35:32,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 03:35:32,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.363636363636363) internal successors, (257), 11 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 264 [2024-11-07 03:35:32,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:32,084 INFO L225 Difference]: With dead ends: 6872 [2024-11-07 03:35:32,084 INFO L226 Difference]: Without dead ends: 4418 [2024-11-07 03:35:32,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-07 03:35:32,088 INFO L432 NwaCegarLoop]: 905 mSDtfsCounter, 1749 mSDsluCounter, 5658 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 6563 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:32,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 6563 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:35:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states. [2024-11-07 03:35:32,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4298. [2024-11-07 03:35:32,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4298 states, 4272 states have (on average 1.3412921348314606) internal successors, (5730), 4272 states have internal predecessors, (5730), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4298 states to 4298 states and 5778 transitions. [2024-11-07 03:35:32,128 INFO L78 Accepts]: Start accepts. Automaton has 4298 states and 5778 transitions. Word has length 264 [2024-11-07 03:35:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:32,129 INFO L471 AbstractCegarLoop]: Abstraction has 4298 states and 5778 transitions. [2024-11-07 03:35:32,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.363636363636363) internal successors, (257), 11 states have internal predecessors, (257), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:32,129 INFO L276 IsEmpty]: Start isEmpty. Operand 4298 states and 5778 transitions. [2024-11-07 03:35:32,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2024-11-07 03:35:32,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:32,132 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:32,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90 [2024-11-07 03:35:32,132 INFO L396 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:32,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash -342655146, now seen corresponding path program 1 times [2024-11-07 03:35:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:32,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801302669] [2024-11-07 03:35:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:32,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:32,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:32,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801302669] [2024-11-07 03:35:32,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801302669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:32,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:32,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:32,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768998330] [2024-11-07 03:35:32,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:32,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:32,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:32,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:32,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:32,501 INFO L87 Difference]: Start difference. First operand 4298 states and 5778 transitions. Second operand has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:32,667 INFO L93 Difference]: Finished difference Result 7567 states and 10275 transitions. [2024-11-07 03:35:32,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 03:35:32,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 265 [2024-11-07 03:35:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:32,674 INFO L225 Difference]: With dead ends: 7567 [2024-11-07 03:35:32,674 INFO L226 Difference]: Without dead ends: 5429 [2024-11-07 03:35:32,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:32,677 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 1779 mSDsluCounter, 5728 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1781 SdHoareTripleChecker+Valid, 6685 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:32,677 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1781 Valid, 6685 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5429 states. [2024-11-07 03:35:32,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5429 to 4302. [2024-11-07 03:35:32,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 4276 states have (on average 1.3405051449953227) internal successors, (5732), 4276 states have internal predecessors, (5732), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:32,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5780 transitions. [2024-11-07 03:35:32,715 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5780 transitions. Word has length 265 [2024-11-07 03:35:32,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:32,715 INFO L471 AbstractCegarLoop]: Abstraction has 4302 states and 5780 transitions. [2024-11-07 03:35:32,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.666666666666668) internal successors, (258), 9 states have internal predecessors, (258), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5780 transitions. [2024-11-07 03:35:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-07 03:35:32,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:32,718 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:32,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91 [2024-11-07 03:35:32,718 INFO L396 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:32,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:32,718 INFO L85 PathProgramCache]: Analyzing trace with hash 581180440, now seen corresponding path program 1 times [2024-11-07 03:35:32,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:32,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121370324] [2024-11-07 03:35:32,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:32,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:32,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:32,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121370324] [2024-11-07 03:35:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121370324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:32,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:32,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:35:32,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907269598] [2024-11-07 03:35:32,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:32,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:35:32,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:32,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:35:32,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:35:32,958 INFO L87 Difference]: Start difference. First operand 4302 states and 5780 transitions. Second operand has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:32,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:32,998 INFO L93 Difference]: Finished difference Result 5895 states and 8032 transitions. [2024-11-07 03:35:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 03:35:32,998 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 266 [2024-11-07 03:35:32,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:33,002 INFO L225 Difference]: With dead ends: 5895 [2024-11-07 03:35:33,002 INFO L226 Difference]: Without dead ends: 4318 [2024-11-07 03:35:33,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-07 03:35:33,004 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 2 mSDsluCounter, 2905 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3877 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:33,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3877 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4318 states. [2024-11-07 03:35:33,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4318 to 4314. [2024-11-07 03:35:33,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4314 states, 4288 states have (on average 1.3400186567164178) internal successors, (5746), 4288 states have internal predecessors, (5746), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:33,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4314 states to 4314 states and 5794 transitions. [2024-11-07 03:35:33,037 INFO L78 Accepts]: Start accepts. Automaton has 4314 states and 5794 transitions. Word has length 266 [2024-11-07 03:35:33,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:33,037 INFO L471 AbstractCegarLoop]: Abstraction has 4314 states and 5794 transitions. [2024-11-07 03:35:33,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 51.8) internal successors, (259), 5 states have internal predecessors, (259), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:33,037 INFO L276 IsEmpty]: Start isEmpty. Operand 4314 states and 5794 transitions. [2024-11-07 03:35:33,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-07 03:35:33,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:33,040 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:33,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92 [2024-11-07 03:35:33,040 INFO L396 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:33,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:33,041 INFO L85 PathProgramCache]: Analyzing trace with hash -272561996, now seen corresponding path program 1 times [2024-11-07 03:35:33,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:33,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654360757] [2024-11-07 03:35:33,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:33,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:33,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:33,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:33,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654360757] [2024-11-07 03:35:33,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654360757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:33,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:33,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:35:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394986547] [2024-11-07 03:35:33,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:33,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:35:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:33,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:35:33,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:33,333 INFO L87 Difference]: Start difference. First operand 4314 states and 5794 transitions. Second operand has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:33,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:33,372 INFO L93 Difference]: Finished difference Result 5939 states and 8088 transitions. [2024-11-07 03:35:33,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:35:33,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 266 [2024-11-07 03:35:33,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:33,378 INFO L225 Difference]: With dead ends: 5939 [2024-11-07 03:35:33,378 INFO L226 Difference]: Without dead ends: 4332 [2024-11-07 03:35:33,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:35:33,380 INFO L432 NwaCegarLoop]: 975 mSDtfsCounter, 0 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:33,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2917 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:35:33,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4332 states. [2024-11-07 03:35:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4332 to 4332. [2024-11-07 03:35:33,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4332 states, 4306 states have (on average 1.3390617742684625) internal successors, (5766), 4306 states have internal predecessors, (5766), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:33,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4332 states to 4332 states and 5814 transitions. [2024-11-07 03:35:33,418 INFO L78 Accepts]: Start accepts. Automaton has 4332 states and 5814 transitions. Word has length 266 [2024-11-07 03:35:33,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:33,418 INFO L471 AbstractCegarLoop]: Abstraction has 4332 states and 5814 transitions. [2024-11-07 03:35:33,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 4332 states and 5814 transitions. [2024-11-07 03:35:33,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-07 03:35:33,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:33,422 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:33,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93 [2024-11-07 03:35:33,422 INFO L396 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash -568162570, now seen corresponding path program 1 times [2024-11-07 03:35:33,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:33,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508854641] [2024-11-07 03:35:33,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:33,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:34,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:34,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:34,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:34,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:34,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508854641] [2024-11-07 03:35:34,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508854641] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:34,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:34,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:34,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78135691] [2024-11-07 03:35:34,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:34,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:34,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:34,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:34,043 INFO L87 Difference]: Start difference. First operand 4332 states and 5814 transitions. Second operand has 11 states, 11 states have (on average 23.545454545454547) internal successors, (259), 11 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:34,433 INFO L93 Difference]: Finished difference Result 5985 states and 8144 transitions. [2024-11-07 03:35:34,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 03:35:34,433 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.545454545454547) internal successors, (259), 11 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 266 [2024-11-07 03:35:34,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:34,437 INFO L225 Difference]: With dead ends: 5985 [2024-11-07 03:35:34,437 INFO L226 Difference]: Without dead ends: 4344 [2024-11-07 03:35:34,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2024-11-07 03:35:34,439 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 1783 mSDsluCounter, 7179 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1785 SdHoareTripleChecker+Valid, 8097 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:34,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1785 Valid, 8097 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:35:34,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4344 states. [2024-11-07 03:35:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4344 to 3880. [2024-11-07 03:35:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3880 states, 3854 states have (on average 1.3476907109496628) internal successors, (5194), 3854 states have internal predecessors, (5194), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3880 states to 3880 states and 5242 transitions. [2024-11-07 03:35:34,472 INFO L78 Accepts]: Start accepts. Automaton has 3880 states and 5242 transitions. Word has length 266 [2024-11-07 03:35:34,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:34,472 INFO L471 AbstractCegarLoop]: Abstraction has 3880 states and 5242 transitions. [2024-11-07 03:35:34,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.545454545454547) internal successors, (259), 11 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:34,472 INFO L276 IsEmpty]: Start isEmpty. Operand 3880 states and 5242 transitions. [2024-11-07 03:35:34,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2024-11-07 03:35:34,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:34,475 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:34,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2024-11-07 03:35:34,476 INFO L396 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1455802271, now seen corresponding path program 1 times [2024-11-07 03:35:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:34,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675496704] [2024-11-07 03:35:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:34,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:35,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:35,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:35,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:35,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:35,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675496704] [2024-11-07 03:35:35,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675496704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:35,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:35,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:35:35,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653488139] [2024-11-07 03:35:35,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:35,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:35:35,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:35,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:35:35,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:35:35,069 INFO L87 Difference]: Start difference. First operand 3880 states and 5242 transitions. Second operand has 11 states, 11 states have (on average 23.545454545454547) internal successors, (259), 11 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:35,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:35,462 INFO L93 Difference]: Finished difference Result 5685 states and 7772 transitions. [2024-11-07 03:35:35,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 03:35:35,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 23.545454545454547) internal successors, (259), 11 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 266 [2024-11-07 03:35:35,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:35,466 INFO L225 Difference]: With dead ends: 5685 [2024-11-07 03:35:35,466 INFO L226 Difference]: Without dead ends: 3896 [2024-11-07 03:35:35,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2024-11-07 03:35:35,468 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 1562 mSDsluCounter, 7187 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1564 SdHoareTripleChecker+Valid, 8105 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:35,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1564 Valid, 8105 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:35:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2024-11-07 03:35:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3884. [2024-11-07 03:35:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3884 states, 3858 states have (on average 1.3473302229134267) internal successors, (5198), 3858 states have internal predecessors, (5198), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3884 states to 3884 states and 5246 transitions. [2024-11-07 03:35:35,497 INFO L78 Accepts]: Start accepts. Automaton has 3884 states and 5246 transitions. Word has length 266 [2024-11-07 03:35:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:35,497 INFO L471 AbstractCegarLoop]: Abstraction has 3884 states and 5246 transitions. [2024-11-07 03:35:35,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 23.545454545454547) internal successors, (259), 11 states have internal predecessors, (259), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3884 states and 5246 transitions. [2024-11-07 03:35:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-07 03:35:35,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:35,500 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:35,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2024-11-07 03:35:35,500 INFO L396 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:35,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -2043816264, now seen corresponding path program 1 times [2024-11-07 03:35:35,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:35,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152154180] [2024-11-07 03:35:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:35,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:35,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-07 03:35:35,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:35,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 03:35:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:35,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:35,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152154180] [2024-11-07 03:35:35,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152154180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:35,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:35,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:35,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131625012] [2024-11-07 03:35:35,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:35,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:35,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:35,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:35,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:35,952 INFO L87 Difference]: Start difference. First operand 3884 states and 5246 transitions. Second operand has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:36,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:36,149 INFO L93 Difference]: Finished difference Result 5687 states and 7766 transitions. [2024-11-07 03:35:36,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:36,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 267 [2024-11-07 03:35:36,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:36,152 INFO L225 Difference]: With dead ends: 5687 [2024-11-07 03:35:36,153 INFO L226 Difference]: Without dead ends: 3926 [2024-11-07 03:35:36,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:36,154 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 1530 mSDsluCounter, 5602 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1532 SdHoareTripleChecker+Valid, 6543 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:36,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1532 Valid, 6543 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:35:36,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2024-11-07 03:35:36,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3888. [2024-11-07 03:35:36,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3888 states, 3862 states have (on average 1.346970481615743) internal successors, (5202), 3862 states have internal predecessors, (5202), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:36,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 5250 transitions. [2024-11-07 03:35:36,185 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 5250 transitions. Word has length 267 [2024-11-07 03:35:36,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:36,185 INFO L471 AbstractCegarLoop]: Abstraction has 3888 states and 5250 transitions. [2024-11-07 03:35:36,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:36,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 5250 transitions. [2024-11-07 03:35:36,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-07 03:35:36,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:36,188 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:36,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable96 [2024-11-07 03:35:36,188 INFO L396 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:36,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -466392644, now seen corresponding path program 1 times [2024-11-07 03:35:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712447634] [2024-11-07 03:35:36,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:36,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-07 03:35:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:36,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 03:35:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:36,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:36,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:36,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712447634] [2024-11-07 03:35:36,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712447634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:36,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:36,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 03:35:36,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666347669] [2024-11-07 03:35:36,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:36,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 03:35:36,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:36,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 03:35:36,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 03:35:36,753 INFO L87 Difference]: Start difference. First operand 3888 states and 5250 transitions. Second operand has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:37,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:37,218 INFO L93 Difference]: Finished difference Result 5811 states and 7920 transitions. [2024-11-07 03:35:37,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 03:35:37,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 267 [2024-11-07 03:35:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:37,222 INFO L225 Difference]: With dead ends: 5811 [2024-11-07 03:35:37,222 INFO L226 Difference]: Without dead ends: 4054 [2024-11-07 03:35:37,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:35:37,224 INFO L432 NwaCegarLoop]: 1206 mSDtfsCounter, 1280 mSDsluCounter, 6783 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1282 SdHoareTripleChecker+Valid, 7989 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:37,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1282 Valid, 7989 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 03:35:37,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2024-11-07 03:35:37,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 3892. [2024-11-07 03:35:37,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3892 states, 3866 states have (on average 1.346611484738748) internal successors, (5206), 3866 states have internal predecessors, (5206), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:37,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3892 states to 3892 states and 5254 transitions. [2024-11-07 03:35:37,255 INFO L78 Accepts]: Start accepts. Automaton has 3892 states and 5254 transitions. Word has length 267 [2024-11-07 03:35:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:37,255 INFO L471 AbstractCegarLoop]: Abstraction has 3892 states and 5254 transitions. [2024-11-07 03:35:37,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 28.88888888888889) internal successors, (260), 9 states have internal predecessors, (260), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-07 03:35:37,256 INFO L276 IsEmpty]: Start isEmpty. Operand 3892 states and 5254 transitions. [2024-11-07 03:35:37,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-07 03:35:37,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:37,258 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:37,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable97 [2024-11-07 03:35:37,258 INFO L396 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1508070103, now seen corresponding path program 1 times [2024-11-07 03:35:37,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982952560] [2024-11-07 03:35:37,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:37,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-07 03:35:37,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:37,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-07 03:35:37,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:35:37,867 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-07 03:35:37,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:35:37,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982952560] [2024-11-07 03:35:37,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982952560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:35:37,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:35:37,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 03:35:37,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830227438] [2024-11-07 03:35:37,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:35:37,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:35:37,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:35:37,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:35:37,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:35:37,868 INFO L87 Difference]: Start difference. First operand 3892 states and 5254 transitions. Second operand has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:35:38,067 INFO L93 Difference]: Finished difference Result 7514 states and 10114 transitions. [2024-11-07 03:35:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 03:35:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 267 [2024-11-07 03:35:38,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:35:38,071 INFO L225 Difference]: With dead ends: 7514 [2024-11-07 03:35:38,071 INFO L226 Difference]: Without dead ends: 3988 [2024-11-07 03:35:38,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 03:35:38,073 INFO L432 NwaCegarLoop]: 900 mSDtfsCounter, 944 mSDsluCounter, 4486 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 945 SdHoareTripleChecker+Valid, 5386 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:35:38,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [945 Valid, 5386 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:35:38,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2024-11-07 03:35:38,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3952. [2024-11-07 03:35:38,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3926 states have (on average 1.347427407030056) internal successors, (5290), 3926 states have internal predecessors, (5290), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:35:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 5338 transitions. [2024-11-07 03:35:38,105 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 5338 transitions. Word has length 267 [2024-11-07 03:35:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:35:38,105 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 5338 transitions. [2024-11-07 03:35:38,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-07 03:35:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 5338 transitions. [2024-11-07 03:35:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-07 03:35:38,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:35:38,108 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 03:35:38,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable98 [2024-11-07 03:35:38,108 INFO L396 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:35:38,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:35:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1122000745, now seen corresponding path program 1 times [2024-11-07 03:35:38,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:35:38,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841233404] [2024-11-07 03:35:38,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:35:38,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:35:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat