./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.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.circular_pointer_top_w16_d8_e0.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', '4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca'] 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.circular_pointer_top_w16_d8_e0.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 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:41:03,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:41:03,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:41:03,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:41:03,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:41:03,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:41:03,118 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:41:03,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:41:03,118 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:41:03,118 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:41:03,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:41:03,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:41:03,119 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:41:03,119 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:41:03,119 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:41:03,119 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:41:03,119 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:41:03,120 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:41:03,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:41:03,121 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:41:03,121 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:41:03,121 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:41:03,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:41:03,121 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:41:03,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:41:03,122 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:41:03,122 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:41:03,122 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:41:03,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:41:03,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:41:03,122 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:41:03,122 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:41:03,122 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 -> 4d887e46d9e1781030c0b6aae8069b6bddec306ee6a48cba2aa303ff66f408ca [2024-11-07 02:41:03,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:41:03,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:41:03,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:41:03,412 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:41:03,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:41:03,415 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.circular_pointer_top_w16_d8_e0.c [2024-11-07 02:41:04,693 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:41:04,932 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:41:04,933 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-07 02:41:04,942 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45cd7ac6b/772a2cc92b87432e98ec928b5a288c38/FLAG8ddcdbcf0 [2024-11-07 02:41:04,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/45cd7ac6b/772a2cc92b87432e98ec928b5a288c38 [2024-11-07 02:41:04,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:41:04,959 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:41:04,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:41:04,960 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:41:04,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:41:04,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:41:04" (1/1) ... [2024-11-07 02:41:04,965 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@590095c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:04, skipping insertion in model container [2024-11-07 02:41:04,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:41:04" (1/1) ... [2024-11-07 02:41:05,006 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:41:05,152 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.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-07 02:41:05,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:41:05,330 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:41:05,338 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.circular_pointer_top_w16_d8_e0.c[1279,1292] [2024-11-07 02:41:05,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:41:05,447 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:41:05,447 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05 WrapperNode [2024-11-07 02:41:05,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:41:05,448 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:41:05,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:41:05,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:41:05,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,622 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1383 [2024-11-07 02:41:05,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:41:05,623 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:41:05,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:41:05,624 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:41:05,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,631 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,665 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,723 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 02:41:05,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,773 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,785 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,807 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,818 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:41:05,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:41:05,851 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:41:05,851 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:41:05,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (1/1) ... [2024-11-07 02:41:05,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:41:05,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:41:05,928 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 02:41:05,931 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 02:41:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:41:05,957 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 02:41:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 02:41:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:41:05,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:41:05,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:41:06,205 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:41:06,207 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:41:07,866 INFO L? ?]: Removed 754 outVars from TransFormulas that were not future-live. [2024-11-07 02:41:07,866 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:41:07,891 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:41:07,895 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:41:07,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:41:07 BoogieIcfgContainer [2024-11-07 02:41:07,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:41:07,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:41:07,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:41:07,902 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:41:07,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:41:04" (1/3) ... [2024-11-07 02:41:07,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bdfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:41:07, skipping insertion in model container [2024-11-07 02:41:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:41:05" (2/3) ... [2024-11-07 02:41:07,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28bdfd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:41:07, skipping insertion in model container [2024-11-07 02:41:07,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:41:07" (3/3) ... [2024-11-07 02:41:07,906 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.circular_pointer_top_w16_d8_e0.c [2024-11-07 02:41:07,921 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:41:07,921 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:41:07,996 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:41:08,006 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;@3a5fa211, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:41:08,006 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:41:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:08,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 02:41:08,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:08,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:08,031 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:08,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1656611576, now seen corresponding path program 1 times [2024-11-07 02:41:08,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:08,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79144982] [2024-11-07 02:41:08,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:08,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:08,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:08,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:08,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79144982] [2024-11-07 02:41:08,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79144982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:08,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:08,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 02:41:08,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041558862] [2024-11-07 02:41:08,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:08,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 02:41:08,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:08,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 02:41:08,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 02:41:08,474 INFO L87 Difference]: Start difference. First operand has 392 states, 386 states have (on average 1.4922279792746114) internal successors, (576), 387 states have internal predecessors, (576), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:41:08,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:08,565 INFO L93 Difference]: Finished difference Result 711 states and 1061 transitions. [2024-11-07 02:41:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 02:41:08,567 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 117 [2024-11-07 02:41:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:08,575 INFO L225 Difference]: With dead ends: 711 [2024-11-07 02:41:08,575 INFO L226 Difference]: Without dead ends: 389 [2024-11-07 02:41:08,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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 02:41:08,585 INFO L432 NwaCegarLoop]: 577 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, 577 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 02:41:08,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:08,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-07 02:41:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-11-07 02:41:08,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 384 states have (on average 1.4869791666666667) internal successors, (571), 384 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 577 transitions. [2024-11-07 02:41:08,638 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 577 transitions. Word has length 117 [2024-11-07 02:41:08,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:08,638 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 577 transitions. [2024-11-07 02:41:08,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:41:08,639 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 577 transitions. [2024-11-07 02:41:08,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 02:41:08,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:08,643 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:08,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:41:08,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:08,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:08,644 INFO L85 PathProgramCache]: Analyzing trace with hash 782291010, now seen corresponding path program 1 times [2024-11-07 02:41:08,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:08,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115774389] [2024-11-07 02:41:08,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:08,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:09,762 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:09,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:09,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115774389] [2024-11-07 02:41:09,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115774389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:09,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:09,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:09,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94212208] [2024-11-07 02:41:09,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:09,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:09,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:09,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:09,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:09,766 INFO L87 Difference]: Start difference. First operand 389 states and 577 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:09,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:09,829 INFO L93 Difference]: Finished difference Result 393 states and 581 transitions. [2024-11-07 02:41:09,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:09,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 117 [2024-11-07 02:41:09,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:09,832 INFO L225 Difference]: With dead ends: 393 [2024-11-07 02:41:09,832 INFO L226 Difference]: Without dead ends: 391 [2024-11-07 02:41:09,833 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 02:41:09,836 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 0 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1719 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 02:41:09,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1719 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:09,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-07 02:41:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-07 02:41:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4844559585492227) internal successors, (573), 386 states have internal predecessors, (573), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 579 transitions. [2024-11-07 02:41:09,855 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 579 transitions. Word has length 117 [2024-11-07 02:41:09,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:09,856 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 579 transitions. [2024-11-07 02:41:09,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:09,857 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 579 transitions. [2024-11-07 02:41:09,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 02:41:09,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:09,858 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:09,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:41:09,859 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:09,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:09,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1517086696, now seen corresponding path program 1 times [2024-11-07 02:41:09,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:09,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476467883] [2024-11-07 02:41:09,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:09,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:10,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:10,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:10,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:10,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476467883] [2024-11-07 02:41:10,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476467883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:10,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:10,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:10,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891075070] [2024-11-07 02:41:10,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:10,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:10,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:10,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:10,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:10,359 INFO L87 Difference]: Start difference. First operand 391 states and 579 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:10,819 INFO L93 Difference]: Finished difference Result 971 states and 1441 transitions. [2024-11-07 02:41:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 118 [2024-11-07 02:41:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:10,823 INFO L225 Difference]: With dead ends: 971 [2024-11-07 02:41:10,823 INFO L226 Difference]: Without dead ends: 391 [2024-11-07 02:41:10,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:10,829 INFO L432 NwaCegarLoop]: 629 mSDtfsCounter, 1090 mSDsluCounter, 1058 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1090 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:10,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1090 Valid, 1687 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:41:10,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2024-11-07 02:41:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 391. [2024-11-07 02:41:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 386 states have (on average 1.4818652849740932) internal successors, (572), 386 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 578 transitions. [2024-11-07 02:41:10,849 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 578 transitions. Word has length 118 [2024-11-07 02:41:10,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:10,849 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 578 transitions. [2024-11-07 02:41:10,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 578 transitions. [2024-11-07 02:41:10,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-07 02:41:10,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:10,853 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:10,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:41:10,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:10,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:10,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1565089340, now seen corresponding path program 1 times [2024-11-07 02:41:10,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:10,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618964953] [2024-11-07 02:41:10,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:10,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:11,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:11,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:11,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618964953] [2024-11-07 02:41:11,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618964953] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:11,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:11,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:11,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518411550] [2024-11-07 02:41:11,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:11,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:11,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:11,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:11,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:11,217 INFO L87 Difference]: Start difference. First operand 391 states and 578 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:11,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:11,258 INFO L93 Difference]: Finished difference Result 714 states and 1055 transitions. [2024-11-07 02:41:11,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:11,260 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 119 [2024-11-07 02:41:11,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:11,264 INFO L225 Difference]: With dead ends: 714 [2024-11-07 02:41:11,264 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:11,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 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 02:41:11,266 INFO L432 NwaCegarLoop]: 574 mSDtfsCounter, 0 mSDsluCounter, 1138 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1712 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 02:41:11,268 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1712 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:11,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:11,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4793814432989691) internal successors, (574), 388 states have internal predecessors, (574), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 580 transitions. [2024-11-07 02:41:11,282 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 580 transitions. Word has length 119 [2024-11-07 02:41:11,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:11,283 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 580 transitions. [2024-11-07 02:41:11,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:11,283 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 580 transitions. [2024-11-07 02:41:11,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 02:41:11,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:11,285 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:11,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:41:11,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:11,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:11,286 INFO L85 PathProgramCache]: Analyzing trace with hash 175163959, now seen corresponding path program 1 times [2024-11-07 02:41:11,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666034197] [2024-11-07 02:41:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:11,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:11,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:11,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666034197] [2024-11-07 02:41:11,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666034197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:11,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:11,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:11,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703250553] [2024-11-07 02:41:11,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:11,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:11,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:11,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:11,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:11,799 INFO L87 Difference]: Start difference. First operand 393 states and 580 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:11,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:11,885 INFO L93 Difference]: Finished difference Result 716 states and 1056 transitions. [2024-11-07 02:41:11,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:11,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 120 [2024-11-07 02:41:11,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:11,888 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:11,888 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:11,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 02:41:11,891 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 487 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:11,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1110 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:11,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4742268041237114) internal successors, (572), 388 states have internal predecessors, (572), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:11,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 578 transitions. [2024-11-07 02:41:11,904 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 578 transitions. Word has length 120 [2024-11-07 02:41:11,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:11,904 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 578 transitions. [2024-11-07 02:41:11,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 578 transitions. [2024-11-07 02:41:11,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 02:41:11,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:11,908 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:11,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:41:11,909 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:11,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:11,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1490569844, now seen corresponding path program 1 times [2024-11-07 02:41:11,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711237750] [2024-11-07 02:41:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711237750] [2024-11-07 02:41:12,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711237750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:12,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:12,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:12,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771300202] [2024-11-07 02:41:12,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:12,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:12,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:12,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:12,376 INFO L87 Difference]: Start difference. First operand 393 states and 578 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:12,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:12,459 INFO L93 Difference]: Finished difference Result 716 states and 1052 transitions. [2024-11-07 02:41:12,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:12,460 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 122 [2024-11-07 02:41:12,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:12,462 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:12,462 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:12,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:12,463 INFO L432 NwaCegarLoop]: 554 mSDtfsCounter, 1041 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:12,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1110 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:12,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:12,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4716494845360826) internal successors, (571), 388 states have internal predecessors, (571), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:12,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 577 transitions. [2024-11-07 02:41:12,488 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 577 transitions. Word has length 122 [2024-11-07 02:41:12,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:12,489 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 577 transitions. [2024-11-07 02:41:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:12,489 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 577 transitions. [2024-11-07 02:41:12,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 02:41:12,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:12,490 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:12,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 02:41:12,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 990395376, now seen corresponding path program 1 times [2024-11-07 02:41:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113635515] [2024-11-07 02:41:12,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:12,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:12,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:12,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:12,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:12,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113635515] [2024-11-07 02:41:12,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113635515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:12,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:12,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:12,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64365301] [2024-11-07 02:41:12,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:12,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:12,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:12,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:12,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:12,995 INFO L87 Difference]: Start difference. First operand 393 states and 577 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:13,120 INFO L93 Difference]: Finished difference Result 716 states and 1050 transitions. [2024-11-07 02:41:13,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:13,121 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 123 [2024-11-07 02:41:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:13,123 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:13,123 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:13,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 02:41:13,124 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 476 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 1064 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 02:41:13,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 1064 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:13,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:13,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4690721649484537) internal successors, (570), 388 states have internal predecessors, (570), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:13,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 576 transitions. [2024-11-07 02:41:13,141 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 576 transitions. Word has length 123 [2024-11-07 02:41:13,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:13,142 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 576 transitions. [2024-11-07 02:41:13,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:13,142 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 576 transitions. [2024-11-07 02:41:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 02:41:13,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:13,143 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:13,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 02:41:13,143 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:13,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:13,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1202028506, now seen corresponding path program 1 times [2024-11-07 02:41:13,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:13,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711911967] [2024-11-07 02:41:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:13,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:13,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711911967] [2024-11-07 02:41:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711911967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:13,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159611927] [2024-11-07 02:41:13,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:13,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:13,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:13,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:13,437 INFO L87 Difference]: Start difference. First operand 393 states and 576 transitions. Second operand has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:13,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:13,543 INFO L93 Difference]: Finished difference Result 718 states and 1050 transitions. [2024-11-07 02:41:13,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:41:13,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 124 [2024-11-07 02:41:13,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:13,545 INFO L225 Difference]: With dead ends: 718 [2024-11-07 02:41:13,546 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:13,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 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 02:41:13,547 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 479 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:13,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1665 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:13,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4664948453608246) internal successors, (569), 388 states have internal predecessors, (569), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:13,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 575 transitions. [2024-11-07 02:41:13,558 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 575 transitions. Word has length 124 [2024-11-07 02:41:13,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:13,558 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 575 transitions. [2024-11-07 02:41:13,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.4) internal successors, (112), 5 states have internal predecessors, (112), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:13,559 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 575 transitions. [2024-11-07 02:41:13,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 02:41:13,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:13,560 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:13,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 02:41:13,560 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:13,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:13,561 INFO L85 PathProgramCache]: Analyzing trace with hash 685921225, now seen corresponding path program 1 times [2024-11-07 02:41:13,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:13,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052240226] [2024-11-07 02:41:13,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:13,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:13,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:13,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052240226] [2024-11-07 02:41:13,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052240226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:13,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:13,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142180131] [2024-11-07 02:41:13,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:13,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:13,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:13,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:13,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:13,882 INFO L87 Difference]: Start difference. First operand 393 states and 575 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:14,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:14,003 INFO L93 Difference]: Finished difference Result 716 states and 1046 transitions. [2024-11-07 02:41:14,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:14,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 125 [2024-11-07 02:41:14,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:14,005 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:14,005 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:14,006 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:14,006 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 1024 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1027 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:14,007 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1027 Valid, 1064 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:14,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4639175257731958) internal successors, (568), 388 states have internal predecessors, (568), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 574 transitions. [2024-11-07 02:41:14,018 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 574 transitions. Word has length 125 [2024-11-07 02:41:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:14,018 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 574 transitions. [2024-11-07 02:41:14,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 574 transitions. [2024-11-07 02:41:14,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 02:41:14,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:14,020 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:14,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 02:41:14,020 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:14,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1133333018, now seen corresponding path program 1 times [2024-11-07 02:41:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:14,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408912101] [2024-11-07 02:41:14,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:14,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:14,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,338 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:14,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:14,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408912101] [2024-11-07 02:41:14,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408912101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:14,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:14,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:14,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120530978] [2024-11-07 02:41:14,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:14,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:14,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:14,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:14,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:14,340 INFO L87 Difference]: Start difference. First operand 393 states and 574 transitions. Second operand has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:14,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:14,468 INFO L93 Difference]: Finished difference Result 716 states and 1044 transitions. [2024-11-07 02:41:14,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:14,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 126 [2024-11-07 02:41:14,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:14,473 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:14,473 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:14,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:14,474 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 1016 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:14,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1064 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.461340206185567) internal successors, (567), 388 states have internal predecessors, (567), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:14,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 573 transitions. [2024-11-07 02:41:14,486 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 573 transitions. Word has length 126 [2024-11-07 02:41:14,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:14,487 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 573 transitions. [2024-11-07 02:41:14,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.8) internal successors, (114), 5 states have internal predecessors, (114), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 573 transitions. [2024-11-07 02:41:14,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 02:41:14,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:14,489 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:14,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 02:41:14,489 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:14,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1944964062, now seen corresponding path program 1 times [2024-11-07 02:41:14,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:14,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626445603] [2024-11-07 02:41:14,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:14,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:14,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-07 02:41:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-07 02:41:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:14,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:14,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626445603] [2024-11-07 02:41:14,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626445603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:14,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:14,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:14,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470831692] [2024-11-07 02:41:14,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:14,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:14,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:14,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:14,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:14,862 INFO L87 Difference]: Start difference. First operand 393 states and 573 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:41:14,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:14,931 INFO L93 Difference]: Finished difference Result 716 states and 1042 transitions. [2024-11-07 02:41:14,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:14,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 127 [2024-11-07 02:41:14,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:14,934 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:14,934 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:14,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 02:41:14,935 INFO L432 NwaCegarLoop]: 553 mSDtfsCounter, 518 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:14,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1108 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.458762886597938) internal successors, (566), 388 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 572 transitions. [2024-11-07 02:41:14,947 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 572 transitions. Word has length 127 [2024-11-07 02:41:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:14,947 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 572 transitions. [2024-11-07 02:41:14,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:41:14,948 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 572 transitions. [2024-11-07 02:41:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 02:41:14,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:14,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:14,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 02:41:14,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:14,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:14,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1181888200, now seen corresponding path program 1 times [2024-11-07 02:41:14,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:14,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024166818] [2024-11-07 02:41:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:14,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:15,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:15,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:15,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 02:41:15,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:15,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 02:41:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024166818] [2024-11-07 02:41:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024166818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037194719] [2024-11-07 02:41:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:15,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:15,437 INFO L87 Difference]: Start difference. First operand 393 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:15,553 INFO L93 Difference]: Finished difference Result 716 states and 1040 transitions. [2024-11-07 02:41:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2024-11-07 02:41:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:15,556 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:15,557 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:15,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:15,558 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 473 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:15,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 1062 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:15,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:15,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4561855670103092) internal successors, (565), 388 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 571 transitions. [2024-11-07 02:41:15,569 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 571 transitions. Word has length 128 [2024-11-07 02:41:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:15,569 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 571 transitions. [2024-11-07 02:41:15,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:15,570 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 571 transitions. [2024-11-07 02:41:15,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 02:41:15,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:15,571 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:15,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 02:41:15,571 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:15,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:15,571 INFO L85 PathProgramCache]: Analyzing trace with hash 988572428, now seen corresponding path program 1 times [2024-11-07 02:41:15,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:15,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835211005] [2024-11-07 02:41:15,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:15,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:15,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:15,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 02:41:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:15,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 02:41:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:16,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:16,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835211005] [2024-11-07 02:41:16,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835211005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:16,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:16,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:16,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716118720] [2024-11-07 02:41:16,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:16,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:16,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:16,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:16,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:16,006 INFO L87 Difference]: Start difference. First operand 393 states and 571 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:16,134 INFO L93 Difference]: Finished difference Result 716 states and 1038 transitions. [2024-11-07 02:41:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:16,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 129 [2024-11-07 02:41:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:16,137 INFO L225 Difference]: With dead ends: 716 [2024-11-07 02:41:16,137 INFO L226 Difference]: Without dead ends: 393 [2024-11-07 02:41:16,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:16,138 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 469 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:16,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1069 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2024-11-07 02:41:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 393. [2024-11-07 02:41:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 388 states have (on average 1.4536082474226804) internal successors, (564), 388 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 570 transitions. [2024-11-07 02:41:16,148 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 570 transitions. Word has length 129 [2024-11-07 02:41:16,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:16,149 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 570 transitions. [2024-11-07 02:41:16,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 570 transitions. [2024-11-07 02:41:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-07 02:41:16,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:16,150 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:16,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 02:41:16,150 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:16,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:16,151 INFO L85 PathProgramCache]: Analyzing trace with hash 406852665, now seen corresponding path program 1 times [2024-11-07 02:41:16,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:16,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109431591] [2024-11-07 02:41:16,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:16,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 02:41:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 02:41:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:16,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:16,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109431591] [2024-11-07 02:41:16,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109431591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:16,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:16,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:16,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230092812] [2024-11-07 02:41:16,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:16,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:16,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:16,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:16,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:16,783 INFO L87 Difference]: Start difference. First operand 393 states and 570 transitions. Second operand has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:17,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:17,003 INFO L93 Difference]: Finished difference Result 722 states and 1044 transitions. [2024-11-07 02:41:17,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:41:17,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 130 [2024-11-07 02:41:17,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:17,006 INFO L225 Difference]: With dead ends: 722 [2024-11-07 02:41:17,006 INFO L226 Difference]: Without dead ends: 397 [2024-11-07 02:41:17,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 02:41:17,007 INFO L432 NwaCegarLoop]: 560 mSDtfsCounter, 2 mSDsluCounter, 1527 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2087 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:17,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2087 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:41:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-07 02:41:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2024-11-07 02:41:17,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4512820512820512) internal successors, (566), 390 states have internal predecessors, (566), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:17,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 572 transitions. [2024-11-07 02:41:17,033 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 572 transitions. Word has length 130 [2024-11-07 02:41:17,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:17,034 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 572 transitions. [2024-11-07 02:41:17,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:17,035 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 572 transitions. [2024-11-07 02:41:17,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-07 02:41:17,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:17,036 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:17,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 02:41:17,036 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:17,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:17,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1709410096, now seen corresponding path program 1 times [2024-11-07 02:41:17,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:17,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981967422] [2024-11-07 02:41:17,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:17,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 02:41:17,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 02:41:17,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,452 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:17,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:17,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981967422] [2024-11-07 02:41:17,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981967422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:17,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:17,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:17,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108378558] [2024-11-07 02:41:17,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:17,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:17,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:17,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:17,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:17,454 INFO L87 Difference]: Start difference. First operand 395 states and 572 transitions. Second operand has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:17,586 INFO L93 Difference]: Finished difference Result 720 states and 1040 transitions. [2024-11-07 02:41:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:17,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 131 [2024-11-07 02:41:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:17,589 INFO L225 Difference]: With dead ends: 720 [2024-11-07 02:41:17,589 INFO L226 Difference]: Without dead ends: 395 [2024-11-07 02:41:17,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:17,592 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 926 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:17,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 1062 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-07 02:41:17,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-07 02:41:17,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4487179487179487) internal successors, (565), 390 states have internal predecessors, (565), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:17,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 571 transitions. [2024-11-07 02:41:17,603 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 571 transitions. Word has length 131 [2024-11-07 02:41:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:17,603 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 571 transitions. [2024-11-07 02:41:17,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 571 transitions. [2024-11-07 02:41:17,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 02:41:17,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:17,605 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:17,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 02:41:17,606 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:17,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:17,606 INFO L85 PathProgramCache]: Analyzing trace with hash -815191116, now seen corresponding path program 1 times [2024-11-07 02:41:17,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:17,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519307223] [2024-11-07 02:41:17,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:17,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-07 02:41:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 02:41:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:17,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:17,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:17,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519307223] [2024-11-07 02:41:17,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519307223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:17,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:17,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726546116] [2024-11-07 02:41:17,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:17,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:17,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:17,940 INFO L87 Difference]: Start difference. First operand 395 states and 571 transitions. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:41:18,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:18,009 INFO L93 Difference]: Finished difference Result 720 states and 1038 transitions. [2024-11-07 02:41:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:18,009 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 132 [2024-11-07 02:41:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:18,011 INFO L225 Difference]: With dead ends: 720 [2024-11-07 02:41:18,011 INFO L226 Difference]: Without dead ends: 395 [2024-11-07 02:41:18,012 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 02:41:18,014 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 513 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:18,014 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 1102 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2024-11-07 02:41:18,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2024-11-07 02:41:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 390 states have (on average 1.4461538461538461) internal successors, (564), 390 states have internal predecessors, (564), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:18,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 570 transitions. [2024-11-07 02:41:18,027 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 570 transitions. Word has length 132 [2024-11-07 02:41:18,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:18,027 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 570 transitions. [2024-11-07 02:41:18,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-07 02:41:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 570 transitions. [2024-11-07 02:41:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-07 02:41:18,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:18,030 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:18,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 02:41:18,030 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:18,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:18,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1900448443, now seen corresponding path program 1 times [2024-11-07 02:41:18,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:18,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572764096] [2024-11-07 02:41:18,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:18,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:18,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:18,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:18,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:18,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 02:41:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:18,701 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:18,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:18,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572764096] [2024-11-07 02:41:18,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572764096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:18,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:18,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:18,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828481816] [2024-11-07 02:41:18,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:18,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:18,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:18,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:18,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:18,703 INFO L87 Difference]: Start difference. First operand 395 states and 570 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:18,752 INFO L93 Difference]: Finished difference Result 766 states and 1093 transitions. [2024-11-07 02:41:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:41:18,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 133 [2024-11-07 02:41:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:18,755 INFO L225 Difference]: With dead ends: 766 [2024-11-07 02:41:18,755 INFO L226 Difference]: Without dead ends: 441 [2024-11-07 02:41:18,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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 02:41:18,756 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 19 mSDsluCounter, 1665 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 2223 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:18,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 2223 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-07 02:41:18,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-11-07 02:41:18,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 434 states have (on average 1.4216589861751152) internal successors, (617), 434 states have internal predecessors, (617), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:18,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 623 transitions. [2024-11-07 02:41:18,769 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 623 transitions. Word has length 133 [2024-11-07 02:41:18,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:18,770 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 623 transitions. [2024-11-07 02:41:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:18,770 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 623 transitions. [2024-11-07 02:41:18,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 02:41:18,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:18,771 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:18,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 02:41:18,772 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -306752993, now seen corresponding path program 1 times [2024-11-07 02:41:18,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:18,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747655530] [2024-11-07 02:41:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:19,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 02:41:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:19,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 02:41:19,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:19,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 02:41:19,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:19,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747655530] [2024-11-07 02:41:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747655530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:19,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:19,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 02:41:19,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119989694] [2024-11-07 02:41:19,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:19,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 02:41:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:19,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 02:41:19,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:41:19,467 INFO L87 Difference]: Start difference. First operand 439 states and 623 transitions. Second operand has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:19,797 INFO L93 Difference]: Finished difference Result 886 states and 1253 transitions. [2024-11-07 02:41:19,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:41:19,797 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 134 [2024-11-07 02:41:19,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:19,800 INFO L225 Difference]: With dead ends: 886 [2024-11-07 02:41:19,800 INFO L226 Difference]: Without dead ends: 443 [2024-11-07 02:41:19,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:41:19,801 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 646 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 2562 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:19,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 2562 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2024-11-07 02:41:19,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2024-11-07 02:41:19,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 436 states have (on average 1.4174311926605505) internal successors, (618), 436 states have internal predecessors, (618), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-07 02:41:19,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 624 transitions. [2024-11-07 02:41:19,813 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 624 transitions. Word has length 134 [2024-11-07 02:41:19,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:19,813 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 624 transitions. [2024-11-07 02:41:19,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.428571428571427) internal successors, (122), 7 states have internal predecessors, (122), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 624 transitions. [2024-11-07 02:41:19,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-07 02:41:19,815 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:19,815 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:19,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 02:41:19,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:19,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1457685238, now seen corresponding path program 1 times [2024-11-07 02:41:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777816249] [2024-11-07 02:41:19,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:20,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:20,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-07 02:41:20,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:20,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777816249] [2024-11-07 02:41:20,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777816249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:20,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:20,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:41:20,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642414363] [2024-11-07 02:41:20,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:20,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:41:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:41:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:20,579 INFO L87 Difference]: Start difference. First operand 441 states and 624 transitions. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:20,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:20,704 INFO L93 Difference]: Finished difference Result 980 states and 1367 transitions. [2024-11-07 02:41:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 135 [2024-11-07 02:41:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:20,707 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:20,707 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:20,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:41:20,708 INFO L432 NwaCegarLoop]: 551 mSDtfsCounter, 857 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 2198 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:20,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 2198 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:20,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3876871880199668) internal successors, (834), 601 states have internal predecessors, (834), 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 02:41:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 846 transitions. [2024-11-07 02:41:20,730 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 846 transitions. Word has length 135 [2024-11-07 02:41:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:20,730 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 846 transitions. [2024-11-07 02:41:20,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:20,731 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 846 transitions. [2024-11-07 02:41:20,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2024-11-07 02:41:20,735 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:20,735 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:20,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 02:41:20,735 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:20,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:20,736 INFO L85 PathProgramCache]: Analyzing trace with hash 2091908698, now seen corresponding path program 1 times [2024-11-07 02:41:20,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:20,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78017709] [2024-11-07 02:41:20,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:20,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:21,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:21,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:21,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2024-11-07 02:41:21,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 02:41:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:21,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 02:41:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:21,412 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:21,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:21,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78017709] [2024-11-07 02:41:21,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78017709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:21,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:21,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947132080] [2024-11-07 02:41:21,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:21,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:21,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:21,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:21,414 INFO L87 Difference]: Start difference. First operand 609 states and 846 transitions. Second operand has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:21,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:21,519 INFO L93 Difference]: Finished difference Result 980 states and 1366 transitions. [2024-11-07 02:41:21,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:21,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 324 [2024-11-07 02:41:21,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:21,524 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:21,525 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:21,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:21,528 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 936 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:21,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 1058 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:21,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:21,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:21,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3860232945091515) internal successors, (833), 601 states have internal predecessors, (833), 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 02:41:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 845 transitions. [2024-11-07 02:41:21,554 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 845 transitions. Word has length 324 [2024-11-07 02:41:21,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:21,555 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 845 transitions. [2024-11-07 02:41:21,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.4) internal successors, (297), 5 states have internal predecessors, (297), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:21,555 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 845 transitions. [2024-11-07 02:41:21,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-07 02:41:21,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:21,561 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:21,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 02:41:21,561 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -722514356, now seen corresponding path program 1 times [2024-11-07 02:41:21,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:21,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582917493] [2024-11-07 02:41:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:22,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:22,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:22,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:22,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-11-07 02:41:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:22,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 02:41:22,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:22,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 02:41:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:22,252 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:22,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:22,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582917493] [2024-11-07 02:41:22,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582917493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:22,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:22,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:22,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975533573] [2024-11-07 02:41:22,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:22,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:22,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:22,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:22,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:22,255 INFO L87 Difference]: Start difference. First operand 609 states and 845 transitions. Second operand has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:22,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:22,356 INFO L93 Difference]: Finished difference Result 980 states and 1364 transitions. [2024-11-07 02:41:22,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:22,357 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 325 [2024-11-07 02:41:22,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:22,360 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:22,360 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:22,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:22,362 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 506 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:22,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1065 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:22,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3843594009983362) internal successors, (832), 601 states have internal predecessors, (832), 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 02:41:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 844 transitions. [2024-11-07 02:41:22,381 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 844 transitions. Word has length 325 [2024-11-07 02:41:22,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:22,381 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 844 transitions. [2024-11-07 02:41:22,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.6) internal successors, (298), 5 states have internal predecessors, (298), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 844 transitions. [2024-11-07 02:41:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-07 02:41:22,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:22,386 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:22,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 02:41:22,386 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:22,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:22,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1951186673, now seen corresponding path program 1 times [2024-11-07 02:41:22,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:22,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98997412] [2024-11-07 02:41:22,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:22,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:23,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2024-11-07 02:41:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 02:41:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-07 02:41:23,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:23,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:23,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98997412] [2024-11-07 02:41:23,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98997412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:23,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:23,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:23,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210916549] [2024-11-07 02:41:23,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:23,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:23,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:23,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:23,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:23,130 INFO L87 Difference]: Start difference. First operand 609 states and 844 transitions. Second operand has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:23,224 INFO L93 Difference]: Finished difference Result 980 states and 1362 transitions. [2024-11-07 02:41:23,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:23,225 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 326 [2024-11-07 02:41:23,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:23,228 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:23,228 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:23,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:23,231 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 904 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:23,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 1058 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:23,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:23,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.382695507487521) internal successors, (831), 601 states have internal predecessors, (831), 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 02:41:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 843 transitions. [2024-11-07 02:41:23,251 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 843 transitions. Word has length 326 [2024-11-07 02:41:23,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:23,252 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 843 transitions. [2024-11-07 02:41:23,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 59.8) internal successors, (299), 5 states have internal predecessors, (299), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:23,253 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 843 transitions. [2024-11-07 02:41:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2024-11-07 02:41:23,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:23,256 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:23,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 02:41:23,256 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:23,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:23,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1071864095, now seen corresponding path program 1 times [2024-11-07 02:41:23,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:23,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485899300] [2024-11-07 02:41:23,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:23,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:23,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:23,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-11-07 02:41:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-07 02:41:23,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-07 02:41:23,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:23,890 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:23,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:23,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485899300] [2024-11-07 02:41:23,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485899300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:23,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:23,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:23,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46187620] [2024-11-07 02:41:23,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:23,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:23,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:23,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:23,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:23,894 INFO L87 Difference]: Start difference. First operand 609 states and 843 transitions. Second operand has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:23,993 INFO L93 Difference]: Finished difference Result 980 states and 1360 transitions. [2024-11-07 02:41:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 327 [2024-11-07 02:41:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:23,996 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:23,997 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:23,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:23,998 INFO L432 NwaCegarLoop]: 528 mSDtfsCounter, 490 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:23,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 1065 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:24,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3810316139767056) internal successors, (830), 601 states have internal predecessors, (830), 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 02:41:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 842 transitions. [2024-11-07 02:41:24,017 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 842 transitions. Word has length 327 [2024-11-07 02:41:24,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:24,017 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 842 transitions. [2024-11-07 02:41:24,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.0) internal successors, (300), 5 states have internal predecessors, (300), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:24,018 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 842 transitions. [2024-11-07 02:41:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-07 02:41:24,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:24,022 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:24,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 02:41:24,022 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:24,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash 437028676, now seen corresponding path program 1 times [2024-11-07 02:41:24,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:24,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398301515] [2024-11-07 02:41:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:24,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:24,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:24,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:24,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:24,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:24,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2024-11-07 02:41:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:24,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-07 02:41:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:24,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 02:41:24,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:24,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:24,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398301515] [2024-11-07 02:41:24,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398301515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:24,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:24,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:24,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775460602] [2024-11-07 02:41:24,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:24,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:24,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:24,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:24,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:24,740 INFO L87 Difference]: Start difference. First operand 609 states and 842 transitions. Second operand has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:24,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:24,812 INFO L93 Difference]: Finished difference Result 980 states and 1358 transitions. [2024-11-07 02:41:24,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:24,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 328 [2024-11-07 02:41:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:24,816 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:24,816 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:24,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:24,817 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 475 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:24,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 1089 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:24,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:24,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:24,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3793677204658903) internal successors, (829), 601 states have internal predecessors, (829), 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 02:41:24,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 841 transitions. [2024-11-07 02:41:24,837 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 841 transitions. Word has length 328 [2024-11-07 02:41:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:24,837 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 841 transitions. [2024-11-07 02:41:24,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.2) internal successors, (301), 5 states have internal predecessors, (301), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:24,838 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 841 transitions. [2024-11-07 02:41:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-07 02:41:24,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:24,844 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:24,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 02:41:24,845 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:24,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:24,845 INFO L85 PathProgramCache]: Analyzing trace with hash -825845002, now seen corresponding path program 1 times [2024-11-07 02:41:24,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:24,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061840539] [2024-11-07 02:41:24,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:24,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:25,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:25,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2024-11-07 02:41:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2024-11-07 02:41:25,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 02:41:25,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:25,548 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:25,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:25,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061840539] [2024-11-07 02:41:25,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061840539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:25,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490605815] [2024-11-07 02:41:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:25,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:25,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:25,552 INFO L87 Difference]: Start difference. First operand 609 states and 841 transitions. Second operand has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:25,622 INFO L93 Difference]: Finished difference Result 980 states and 1356 transitions. [2024-11-07 02:41:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:25,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 329 [2024-11-07 02:41:25,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:25,629 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:25,630 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:25,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:25,631 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 849 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:25,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1082 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:25,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:25,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.377703826955075) internal successors, (828), 601 states have internal predecessors, (828), 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 02:41:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 840 transitions. [2024-11-07 02:41:25,650 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 840 transitions. Word has length 329 [2024-11-07 02:41:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:25,650 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 840 transitions. [2024-11-07 02:41:25,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.4) internal successors, (302), 5 states have internal predecessors, (302), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:25,650 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 840 transitions. [2024-11-07 02:41:25,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-07 02:41:25,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:25,654 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:25,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 02:41:25,655 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:25,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:25,655 INFO L85 PathProgramCache]: Analyzing trace with hash -174190343, now seen corresponding path program 1 times [2024-11-07 02:41:25,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:25,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522411476] [2024-11-07 02:41:25,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:25,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:26,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:26,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:26,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:26,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:26,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-11-07 02:41:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2024-11-07 02:41:26,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2024-11-07 02:41:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:26,461 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522411476] [2024-11-07 02:41:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522411476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:26,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:26,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:26,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579656940] [2024-11-07 02:41:26,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:26,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:26,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:26,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:26,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:26,465 INFO L87 Difference]: Start difference. First operand 609 states and 840 transitions. Second operand has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:26,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:26,780 INFO L93 Difference]: Finished difference Result 980 states and 1354 transitions. [2024-11-07 02:41:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:26,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 330 [2024-11-07 02:41:26,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:26,787 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:26,787 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:26,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:26,788 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 789 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:26,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 802 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:26,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:26,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3760399334442597) internal successors, (827), 601 states have internal predecessors, (827), 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 02:41:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 839 transitions. [2024-11-07 02:41:26,811 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 839 transitions. Word has length 330 [2024-11-07 02:41:26,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:26,811 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 839 transitions. [2024-11-07 02:41:26,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 60.6) internal successors, (303), 5 states have internal predecessors, (303), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:26,812 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 839 transitions. [2024-11-07 02:41:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2024-11-07 02:41:26,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:26,817 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:26,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 02:41:26,818 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:26,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:26,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1306618507, now seen corresponding path program 1 times [2024-11-07 02:41:26,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:26,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565152456] [2024-11-07 02:41:26,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:26,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:28,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:28,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:28,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:28,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:28,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2024-11-07 02:41:28,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:28,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-11-07 02:41:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:28,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-07 02:41:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:28,172 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:28,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:28,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565152456] [2024-11-07 02:41:28,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565152456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:28,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:28,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:28,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643224007] [2024-11-07 02:41:28,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:28,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:28,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:28,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:28,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:28,174 INFO L87 Difference]: Start difference. First operand 609 states and 839 transitions. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:28,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:28,238 INFO L93 Difference]: Finished difference Result 980 states and 1352 transitions. [2024-11-07 02:41:28,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:28,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 331 [2024-11-07 02:41:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:28,241 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:28,242 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:28,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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 02:41:28,243 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 381 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:28,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1080 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:41:28,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:28,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:28,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3743760399334441) internal successors, (826), 601 states have internal predecessors, (826), 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 02:41:28,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 838 transitions. [2024-11-07 02:41:28,265 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 838 transitions. Word has length 331 [2024-11-07 02:41:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:28,266 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 838 transitions. [2024-11-07 02:41:28,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:28,266 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 838 transitions. [2024-11-07 02:41:28,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-07 02:41:28,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:28,270 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:28,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-07 02:41:28,271 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:28,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:28,271 INFO L85 PathProgramCache]: Analyzing trace with hash 84549355, now seen corresponding path program 1 times [2024-11-07 02:41:28,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:28,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511028719] [2024-11-07 02:41:28,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:28,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:28,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:29,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:29,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:29,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:29,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2024-11-07 02:41:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:29,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-11-07 02:41:29,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2024-11-07 02:41:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:29,491 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:29,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:29,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511028719] [2024-11-07 02:41:29,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511028719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:29,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:29,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:29,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290823164] [2024-11-07 02:41:29,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:29,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:29,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:29,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:29,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:29,494 INFO L87 Difference]: Start difference. First operand 609 states and 838 transitions. Second operand has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:29,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:29,600 INFO L93 Difference]: Finished difference Result 980 states and 1350 transitions. [2024-11-07 02:41:29,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:29,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 332 [2024-11-07 02:41:29,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:29,609 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:29,610 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:29,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:29,611 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 861 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:29,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 1050 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:29,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:29,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3727121464226288) internal successors, (825), 601 states have internal predecessors, (825), 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 02:41:29,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 837 transitions. [2024-11-07 02:41:29,632 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 837 transitions. Word has length 332 [2024-11-07 02:41:29,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:29,632 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 837 transitions. [2024-11-07 02:41:29,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:29,633 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 837 transitions. [2024-11-07 02:41:29,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-11-07 02:41:29,637 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:29,638 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:29,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-07 02:41:29,638 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1221638347, now seen corresponding path program 1 times [2024-11-07 02:41:29,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:29,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210828058] [2024-11-07 02:41:29,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:29,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:30,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:30,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:30,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:30,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:30,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-11-07 02:41:30,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:30,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 258 [2024-11-07 02:41:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:30,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 02:41:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:30,599 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:30,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:30,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210828058] [2024-11-07 02:41:30,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210828058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:30,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:30,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:30,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320905749] [2024-11-07 02:41:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:30,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:30,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:30,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:30,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:30,602 INFO L87 Difference]: Start difference. First operand 609 states and 837 transitions. Second operand has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:30,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:30,707 INFO L93 Difference]: Finished difference Result 980 states and 1348 transitions. [2024-11-07 02:41:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:30,708 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 333 [2024-11-07 02:41:30,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:30,710 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:30,710 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:30,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:30,712 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 453 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:30,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 1057 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:30,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:30,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3710482529118135) internal successors, (824), 601 states have internal predecessors, (824), 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 02:41:30,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 836 transitions. [2024-11-07 02:41:30,729 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 836 transitions. Word has length 333 [2024-11-07 02:41:30,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:30,730 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 836 transitions. [2024-11-07 02:41:30,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.2) internal successors, (306), 5 states have internal predecessors, (306), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:30,730 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 836 transitions. [2024-11-07 02:41:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2024-11-07 02:41:30,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:30,732 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:30,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-07 02:41:30,733 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:30,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:30,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1872351418, now seen corresponding path program 1 times [2024-11-07 02:41:30,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:30,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013591750] [2024-11-07 02:41:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:30,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:31,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:31,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:31,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:31,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:31,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2024-11-07 02:41:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:31,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2024-11-07 02:41:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:31,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-07 02:41:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:31,780 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:31,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:31,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013591750] [2024-11-07 02:41:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013591750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:31,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:31,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567606037] [2024-11-07 02:41:31,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:31,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:31,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:31,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:31,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:31,784 INFO L87 Difference]: Start difference. First operand 609 states and 836 transitions. Second operand has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:31,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:31,885 INFO L93 Difference]: Finished difference Result 980 states and 1346 transitions. [2024-11-07 02:41:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 334 [2024-11-07 02:41:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:31,888 INFO L225 Difference]: With dead ends: 980 [2024-11-07 02:41:31,888 INFO L226 Difference]: Without dead ends: 609 [2024-11-07 02:41:31,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:31,889 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 452 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:31,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1057 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:41:31,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2024-11-07 02:41:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 609. [2024-11-07 02:41:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 609 states, 601 states have (on average 1.3693843594009982) internal successors, (823), 601 states have internal predecessors, (823), 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 02:41:31,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 835 transitions. [2024-11-07 02:41:31,905 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 835 transitions. Word has length 334 [2024-11-07 02:41:31,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:31,906 INFO L471 AbstractCegarLoop]: Abstraction has 609 states and 835 transitions. [2024-11-07 02:41:31,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.4) internal successors, (307), 5 states have internal predecessors, (307), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:31,906 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 835 transitions. [2024-11-07 02:41:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2024-11-07 02:41:31,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:31,909 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:31,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-07 02:41:31,910 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:31,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2098226244, now seen corresponding path program 1 times [2024-11-07 02:41:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139830676] [2024-11-07 02:41:31,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:31,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:33,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:33,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:33,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:33,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2024-11-07 02:41:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:33,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2024-11-07 02:41:33,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:33,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2024-11-07 02:41:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:33,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:33,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139830676] [2024-11-07 02:41:33,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139830676] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:33,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:33,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:41:33,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794671713] [2024-11-07 02:41:33,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:33,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:41:33,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:33,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:41:33,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:33,038 INFO L87 Difference]: Start difference. First operand 609 states and 835 transitions. Second operand has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:33,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:33,413 INFO L93 Difference]: Finished difference Result 1429 states and 1965 transitions. [2024-11-07 02:41:33,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:33,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 335 [2024-11-07 02:41:33,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:33,418 INFO L225 Difference]: With dead ends: 1429 [2024-11-07 02:41:33,418 INFO L226 Difference]: Without dead ends: 1058 [2024-11-07 02:41:33,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 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 02:41:33,421 INFO L432 NwaCegarLoop]: 457 mSDtfsCounter, 591 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:33,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1968 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:33,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-07 02:41:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 936. [2024-11-07 02:41:33,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 936 states, 925 states have (on average 1.3654054054054054) internal successors, (1263), 925 states have internal predecessors, (1263), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 02:41:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1281 transitions. [2024-11-07 02:41:33,449 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1281 transitions. Word has length 335 [2024-11-07 02:41:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:33,450 INFO L471 AbstractCegarLoop]: Abstraction has 936 states and 1281 transitions. [2024-11-07 02:41:33,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.333333333333336) internal successors, (308), 6 states have internal predecessors, (308), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1281 transitions. [2024-11-07 02:41:33,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-07 02:41:33,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:33,453 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:33,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-07 02:41:33,454 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:33,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:33,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1248794528, now seen corresponding path program 1 times [2024-11-07 02:41:33,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:33,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833819972] [2024-11-07 02:41:33,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:33,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:34,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:34,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:34,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:34,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:34,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-07 02:41:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:34,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 02:41:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:34,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-07 02:41:34,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:34,761 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:34,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:34,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833819972] [2024-11-07 02:41:34,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833819972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:34,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:34,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:41:34,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244523902] [2024-11-07 02:41:34,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:34,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:41:34,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:34,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:41:34,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:34,764 INFO L87 Difference]: Start difference. First operand 936 states and 1281 transitions. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:35,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:35,266 INFO L93 Difference]: Finished difference Result 1330 states and 1824 transitions. [2024-11-07 02:41:35,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:35,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-07 02:41:35,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:35,271 INFO L225 Difference]: With dead ends: 1330 [2024-11-07 02:41:35,271 INFO L226 Difference]: Without dead ends: 959 [2024-11-07 02:41:35,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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 02:41:35,273 INFO L432 NwaCegarLoop]: 397 mSDtfsCounter, 766 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 635 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:35,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1579 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 635 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 02:41:35,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2024-11-07 02:41:35,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 937. [2024-11-07 02:41:35,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 926 states have (on average 1.3650107991360692) internal successors, (1264), 926 states have internal predecessors, (1264), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-07 02:41:35,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1282 transitions. [2024-11-07 02:41:35,303 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1282 transitions. Word has length 336 [2024-11-07 02:41:35,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:35,304 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1282 transitions. [2024-11-07 02:41:35,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:35,304 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1282 transitions. [2024-11-07 02:41:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2024-11-07 02:41:35,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:35,308 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-07 02:41:35,308 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:35,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:35,308 INFO L85 PathProgramCache]: Analyzing trace with hash 214777389, now seen corresponding path program 1 times [2024-11-07 02:41:35,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:35,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807732206] [2024-11-07 02:41:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:41:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 02:41:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:41:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-11-07 02:41:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-11-07 02:41:37,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2024-11-07 02:41:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:37,073 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-07 02:41:37,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:37,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807732206] [2024-11-07 02:41:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807732206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:37,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:37,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:41:37,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097672073] [2024-11-07 02:41:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:37,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:41:37,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:37,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:41:37,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:37,076 INFO L87 Difference]: Start difference. First operand 937 states and 1282 transitions. Second operand has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:38,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:38,356 INFO L93 Difference]: Finished difference Result 2112 states and 2883 transitions. [2024-11-07 02:41:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:41:38,356 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 336 [2024-11-07 02:41:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:38,363 INFO L225 Difference]: With dead ends: 2112 [2024-11-07 02:41:38,363 INFO L226 Difference]: Without dead ends: 1625 [2024-11-07 02:41:38,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:41:38,365 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 1362 mSDsluCounter, 3404 mSDsCounter, 0 mSdLazyCounter, 1881 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 4322 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:38,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 4322 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1881 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 02:41:38,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2024-11-07 02:41:38,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1006. [2024-11-07 02:41:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 992 states have (on average 1.3669354838709677) internal successors, (1356), 992 states have internal predecessors, (1356), 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 02:41:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1380 transitions. [2024-11-07 02:41:38,410 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1380 transitions. Word has length 336 [2024-11-07 02:41:38,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:38,411 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1380 transitions. [2024-11-07 02:41:38,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.375) internal successors, (259), 8 states have internal predecessors, (259), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:38,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1380 transitions. [2024-11-07 02:41:38,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-07 02:41:38,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:38,414 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:38,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-07 02:41:38,415 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:38,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:38,415 INFO L85 PathProgramCache]: Analyzing trace with hash 401373631, now seen corresponding path program 1 times [2024-11-07 02:41:38,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:38,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922334613] [2024-11-07 02:41:38,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:39,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:39,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:39,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:39,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-07 02:41:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:39,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 02:41:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:39,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-07 02:41:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-07 02:41:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:39,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922334613] [2024-11-07 02:41:39,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922334613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:39,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:39,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:41:39,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098748624] [2024-11-07 02:41:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:39,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:41:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:39,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:41:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:41:39,817 INFO L87 Difference]: Start difference. First operand 1006 states and 1380 transitions. Second operand has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:40,068 INFO L93 Difference]: Finished difference Result 1672 states and 2269 transitions. [2024-11-07 02:41:40,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:41:40,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 337 [2024-11-07 02:41:40,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:40,072 INFO L225 Difference]: With dead ends: 1672 [2024-11-07 02:41:40,072 INFO L226 Difference]: Without dead ends: 1018 [2024-11-07 02:41:40,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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 02:41:40,073 INFO L432 NwaCegarLoop]: 403 mSDtfsCounter, 323 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:40,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1188 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:41:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2024-11-07 02:41:40,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1012. [2024-11-07 02:41:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 998 states have (on average 1.3647294589178356) internal successors, (1362), 998 states have internal predecessors, (1362), 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 02:41:40,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1386 transitions. [2024-11-07 02:41:40,096 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1386 transitions. Word has length 337 [2024-11-07 02:41:40,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:40,096 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1386 transitions. [2024-11-07 02:41:40,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.8) internal successors, (269), 5 states have internal predecessors, (269), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:41:40,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1386 transitions. [2024-11-07 02:41:40,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-11-07 02:41:40,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:40,100 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:40,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-07 02:41:40,100 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:40,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1255397875, now seen corresponding path program 1 times [2024-11-07 02:41:40,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:40,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835371063] [2024-11-07 02:41:40,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:40,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:41,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:41,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:41,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:41,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:41,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2024-11-07 02:41:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2024-11-07 02:41:41,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:41,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2024-11-07 02:41:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:41,066 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-07 02:41:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:41,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835371063] [2024-11-07 02:41:41,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835371063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:41,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:41,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:41:41,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680770720] [2024-11-07 02:41:41,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:41,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:41,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:41,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:41,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:41,069 INFO L87 Difference]: Start difference. First operand 1012 states and 1386 transitions. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:41,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:41,323 INFO L93 Difference]: Finished difference Result 1668 states and 2259 transitions. [2024-11-07 02:41:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:41,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 337 [2024-11-07 02:41:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:41,327 INFO L225 Difference]: With dead ends: 1668 [2024-11-07 02:41:41,327 INFO L226 Difference]: Without dead ends: 1012 [2024-11-07 02:41:41,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:41:41,329 INFO L432 NwaCegarLoop]: 404 mSDtfsCounter, 501 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 501 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:41,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [501 Valid, 807 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:41:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-07 02:41:41,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1012. [2024-11-07 02:41:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 998 states have (on average 1.3587174348697395) internal successors, (1356), 998 states have internal predecessors, (1356), 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 02:41:41,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1380 transitions. [2024-11-07 02:41:41,353 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1380 transitions. Word has length 337 [2024-11-07 02:41:41,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:41,353 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1380 transitions. [2024-11-07 02:41:41,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1380 transitions. [2024-11-07 02:41:41,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2024-11-07 02:41:41,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:41,357 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:41,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-07 02:41:41,357 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:41,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:41,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1921807987, now seen corresponding path program 1 times [2024-11-07 02:41:41,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:41,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165885540] [2024-11-07 02:41:41,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:41,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:41,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:42,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:42,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:42,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:42,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2024-11-07 02:41:42,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2024-11-07 02:41:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-11-07 02:41:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:42,637 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2024-11-07 02:41:42,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:42,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165885540] [2024-11-07 02:41:42,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165885540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:42,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:42,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:41:42,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397061049] [2024-11-07 02:41:42,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:42,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:41:42,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:42,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:41:42,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:42,640 INFO L87 Difference]: Start difference. First operand 1012 states and 1380 transitions. Second operand has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:43,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:43,235 INFO L93 Difference]: Finished difference Result 2518 states and 3403 transitions. [2024-11-07 02:41:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 02:41:43,236 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 339 [2024-11-07 02:41:43,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:43,241 INFO L225 Difference]: With dead ends: 2518 [2024-11-07 02:41:43,241 INFO L226 Difference]: Without dead ends: 1878 [2024-11-07 02:41:43,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:41:43,243 INFO L432 NwaCegarLoop]: 416 mSDtfsCounter, 1289 mSDsluCounter, 1986 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 2402 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:43,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 2402 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 02:41:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1878 states. [2024-11-07 02:41:43,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1878 to 1870. [2024-11-07 02:41:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1870 states, 1844 states have (on average 1.3503253796095445) internal successors, (2490), 1844 states have internal predecessors, (2490), 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 02:41:43,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1870 states to 1870 states and 2538 transitions. [2024-11-07 02:41:43,293 INFO L78 Accepts]: Start accepts. Automaton has 1870 states and 2538 transitions. Word has length 339 [2024-11-07 02:41:43,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:43,294 INFO L471 AbstractCegarLoop]: Abstraction has 1870 states and 2538 transitions. [2024-11-07 02:41:43,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1870 states and 2538 transitions. [2024-11-07 02:41:43,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-07 02:41:43,299 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:43,300 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:43,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-07 02:41:43,301 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:43,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:43,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2080700861, now seen corresponding path program 1 times [2024-11-07 02:41:43,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:43,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074284118] [2024-11-07 02:41:43,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:43,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 02:41:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:44,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 02:41:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 02:41:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:44,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-11-07 02:41:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:44,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2024-11-07 02:41:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:44,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2024-11-07 02:41:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 79 proven. 4 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-07 02:41:44,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074284118] [2024-11-07 02:41:44,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074284118] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 02:41:44,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239129861] [2024-11-07 02:41:44,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:44,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 02:41:44,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:41:44,537 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 02:41:44,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 02:41:45,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:45,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 2047 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 02:41:45,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:41:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-07 02:41:45,915 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:41:45,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239129861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:45,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 02:41:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2024-11-07 02:41:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894963612] [2024-11-07 02:41:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:45,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:41:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:45,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:41:45,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:41:45,917 INFO L87 Difference]: Start difference. First operand 1870 states and 2538 transitions. Second operand has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:46,179 INFO L93 Difference]: Finished difference Result 2599 states and 3514 transitions. [2024-11-07 02:41:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:41:46,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 341 [2024-11-07 02:41:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:46,184 INFO L225 Difference]: With dead ends: 2599 [2024-11-07 02:41:46,184 INFO L226 Difference]: Without dead ends: 1010 [2024-11-07 02:41:46,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:41:46,187 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 458 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:46,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 794 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 02:41:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1010 states. [2024-11-07 02:41:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1010 to 1010. [2024-11-07 02:41:46,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1010 states, 996 states have (on average 1.3534136546184738) internal successors, (1348), 996 states have internal predecessors, (1348), 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 02:41:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1010 states to 1010 states and 1372 transitions. [2024-11-07 02:41:46,211 INFO L78 Accepts]: Start accepts. Automaton has 1010 states and 1372 transitions. Word has length 341 [2024-11-07 02:41:46,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:46,211 INFO L471 AbstractCegarLoop]: Abstraction has 1010 states and 1372 transitions. [2024-11-07 02:41:46,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.5) internal successors, (286), 4 states have internal predecessors, (286), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-07 02:41:46,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1010 states and 1372 transitions. [2024-11-07 02:41:46,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2024-11-07 02:41:46,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:46,215 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:46,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 02:41:46,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-07 02:41:46,416 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:46,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1578736179, now seen corresponding path program 1 times [2024-11-07 02:41:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:46,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351015262] [2024-11-07 02:41:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:48,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:41:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:48,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 02:41:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:48,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 02:41:48,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2024-11-07 02:41:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:48,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2024-11-07 02:41:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:48,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2024-11-07 02:41:48,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:48,363 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-07 02:41:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351015262] [2024-11-07 02:41:48,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351015262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:48,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:48,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 02:41:48,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012961411] [2024-11-07 02:41:48,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:48,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 02:41:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 02:41:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:41:48,366 INFO L87 Difference]: Start difference. First operand 1010 states and 1372 transitions. Second operand has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:49,216 INFO L93 Difference]: Finished difference Result 2457 states and 3296 transitions. [2024-11-07 02:41:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 02:41:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 341 [2024-11-07 02:41:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:49,223 INFO L225 Difference]: With dead ends: 2457 [2024-11-07 02:41:49,223 INFO L226 Difference]: Without dead ends: 1746 [2024-11-07 02:41:49,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:41:49,225 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 2136 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 1470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:49,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 3382 Invalid, 1470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 02:41:49,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-07 02:41:49,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1126. [2024-11-07 02:41:49,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1126 states, 1108 states have (on average 1.364620938628159) internal successors, (1512), 1108 states have internal predecessors, (1512), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 02:41:49,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1126 states to 1126 states and 1544 transitions. [2024-11-07 02:41:49,251 INFO L78 Accepts]: Start accepts. Automaton has 1126 states and 1544 transitions. Word has length 341 [2024-11-07 02:41:49,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:49,251 INFO L471 AbstractCegarLoop]: Abstraction has 1126 states and 1544 transitions. [2024-11-07 02:41:49,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.1) internal successors, (271), 10 states have internal predecessors, (271), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 1126 states and 1544 transitions. [2024-11-07 02:41:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-07 02:41:49,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:49,255 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:49,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-07 02:41:49,255 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:49,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 675720909, now seen corresponding path program 1 times [2024-11-07 02:41:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:49,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943508536] [2024-11-07 02:41:49,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:49,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:49,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:41:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 02:41:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:50,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 02:41:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:50,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-11-07 02:41:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-11-07 02:41:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:50,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2024-11-07 02:41:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:50,360 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-07 02:41:50,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:50,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943508536] [2024-11-07 02:41:50,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943508536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:50,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:50,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 02:41:50,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549820622] [2024-11-07 02:41:50,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:50,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 02:41:50,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:50,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 02:41:50,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:41:50,363 INFO L87 Difference]: Start difference. First operand 1126 states and 1544 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 02:41:50,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:50,739 INFO L93 Difference]: Finished difference Result 2071 states and 2832 transitions. [2024-11-07 02:41:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 343 [2024-11-07 02:41:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:50,748 INFO L225 Difference]: With dead ends: 2071 [2024-11-07 02:41:50,748 INFO L226 Difference]: Without dead ends: 1142 [2024-11-07 02:41:50,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:41:50,751 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 536 mSDsluCounter, 1170 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 538 SdHoareTripleChecker+Valid, 1560 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:50,751 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [538 Valid, 1560 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:50,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-07 02:41:50,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1134. [2024-11-07 02:41:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1134 states, 1116 states have (on average 1.3584229390681004) internal successors, (1516), 1116 states have internal predecessors, (1516), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 02:41:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1134 states to 1134 states and 1548 transitions. [2024-11-07 02:41:50,775 INFO L78 Accepts]: Start accepts. Automaton has 1134 states and 1548 transitions. Word has length 343 [2024-11-07 02:41:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:50,775 INFO L471 AbstractCegarLoop]: Abstraction has 1134 states and 1548 transitions. [2024-11-07 02:41:50,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 7 states have internal predecessors, (254), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 02:41:50,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1134 states and 1548 transitions. [2024-11-07 02:41:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2024-11-07 02:41:50,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:50,779 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:50,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-07 02:41:50,779 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:50,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1280165033, now seen corresponding path program 1 times [2024-11-07 02:41:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95817426] [2024-11-07 02:41:50,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:41:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 02:41:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:52,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2024-11-07 02:41:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:52,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2024-11-07 02:41:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:52,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2024-11-07 02:41:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:52,119 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-07 02:41:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95817426] [2024-11-07 02:41:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95817426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:52,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:41:52,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308908739] [2024-11-07 02:41:52,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:52,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:41:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:52,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:41:52,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:41:52,122 INFO L87 Difference]: Start difference. First operand 1134 states and 1548 transitions. Second operand has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 02:41:52,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:52,505 INFO L93 Difference]: Finished difference Result 2061 states and 2807 transitions. [2024-11-07 02:41:52,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 345 [2024-11-07 02:41:52,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:52,509 INFO L225 Difference]: With dead ends: 2061 [2024-11-07 02:41:52,510 INFO L226 Difference]: Without dead ends: 1142 [2024-11-07 02:41:52,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 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 02:41:52,511 INFO L432 NwaCegarLoop]: 390 mSDtfsCounter, 495 mSDsluCounter, 1163 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:52,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 1553 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 642 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:52,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2024-11-07 02:41:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1138. [2024-11-07 02:41:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1120 states have (on average 1.3571428571428572) internal successors, (1520), 1120 states have internal predecessors, (1520), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 02:41:52,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1552 transitions. [2024-11-07 02:41:52,529 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1552 transitions. Word has length 345 [2024-11-07 02:41:52,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:52,529 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1552 transitions. [2024-11-07 02:41:52,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.666666666666664) internal successors, (256), 6 states have internal predecessors, (256), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-07 02:41:52,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1552 transitions. [2024-11-07 02:41:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-07 02:41:52,533 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:52,533 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:52,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-07 02:41:52,534 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:52,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:52,534 INFO L85 PathProgramCache]: Analyzing trace with hash -240678099, now seen corresponding path program 1 times [2024-11-07 02:41:52,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:52,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373453512] [2024-11-07 02:41:52,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:52,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:54,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:41:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:54,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 02:41:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:54,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 02:41:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:54,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-07 02:41:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:54,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 02:41:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:54,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2024-11-07 02:41:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:54,233 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:41:54,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:54,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373453512] [2024-11-07 02:41:54,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373453512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 02:41:54,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [455750942] [2024-11-07 02:41:54,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:54,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 02:41:54,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:41:54,238 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 02:41:54,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 02:41:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:55,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 02:41:55,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:41:55,980 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 80 proven. 4 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-07 02:41:55,980 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:41:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-07 02:41:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [455750942] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 02:41:56,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:41:56,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 9] total 25 [2024-11-07 02:41:56,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705266229] [2024-11-07 02:41:56,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:56,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:41:56,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:41:56,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-07 02:41:56,215 INFO L87 Difference]: Start difference. First operand 1138 states and 1552 transitions. Second operand has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 02:41:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:56,597 INFO L93 Difference]: Finished difference Result 2009 states and 2729 transitions. [2024-11-07 02:41:56,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:41:56,598 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 347 [2024-11-07 02:41:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:56,601 INFO L225 Difference]: With dead ends: 2009 [2024-11-07 02:41:56,601 INFO L226 Difference]: Without dead ends: 1170 [2024-11-07 02:41:56,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2024-11-07 02:41:56,603 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1074 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1076 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:56,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1076 Valid, 1563 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:56,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-11-07 02:41:56,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1170. [2024-11-07 02:41:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1170 states, 1152 states have (on average 1.3576388888888888) internal successors, (1564), 1152 states have internal predecessors, (1564), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-07 02:41:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1596 transitions. [2024-11-07 02:41:56,631 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1596 transitions. Word has length 347 [2024-11-07 02:41:56,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:56,631 INFO L471 AbstractCegarLoop]: Abstraction has 1170 states and 1596 transitions. [2024-11-07 02:41:56,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-07 02:41:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1596 transitions. [2024-11-07 02:41:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-07 02:41:56,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:56,634 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:41:56,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 02:41:56,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 02:41:56,836 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:56,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:56,836 INFO L85 PathProgramCache]: Analyzing trace with hash -167980851, now seen corresponding path program 1 times [2024-11-07 02:41:56,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:56,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293553382] [2024-11-07 02:41:56,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:56,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:41:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:41:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:59,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 02:41:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:59,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:41:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-07 02:41:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:59,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 02:41:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:59,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-07 02:41:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:41:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-07 02:41:59,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:41:59,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293553382] [2024-11-07 02:41:59,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293553382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:41:59,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:41:59,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 02:41:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134815638] [2024-11-07 02:41:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:41:59,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 02:41:59,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:41:59,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 02:41:59,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:41:59,368 INFO L87 Difference]: Start difference. First operand 1170 states and 1596 transitions. Second operand has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:41:59,802 INFO L93 Difference]: Finished difference Result 2207 states and 2999 transitions. [2024-11-07 02:41:59,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 02:41:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 347 [2024-11-07 02:41:59,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:41:59,807 INFO L225 Difference]: With dead ends: 2207 [2024-11-07 02:41:59,807 INFO L226 Difference]: Without dead ends: 1538 [2024-11-07 02:41:59,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-07 02:41:59,809 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 1246 mSDsluCounter, 5173 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 6015 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:41:59,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 6015 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 02:41:59,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-07 02:41:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1235. [2024-11-07 02:41:59,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1214 states have (on average 1.3599670510708401) internal successors, (1651), 1214 states have internal predecessors, (1651), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 02:41:59,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1689 transitions. [2024-11-07 02:41:59,839 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1689 transitions. Word has length 347 [2024-11-07 02:41:59,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:41:59,839 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1689 transitions. [2024-11-07 02:41:59,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 27.2) internal successors, (272), 10 states have internal predecessors, (272), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:41:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1689 transitions. [2024-11-07 02:41:59,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-11-07 02:41:59,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:41:59,842 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:41:59,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-07 02:41:59,843 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:41:59,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:41:59,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1056061037, now seen corresponding path program 1 times [2024-11-07 02:41:59,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:41:59,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089735989] [2024-11-07 02:41:59,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:41:59,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:42:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:01,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:42:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:01,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 02:42:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:01,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 02:42:01,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:01,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2024-11-07 02:42:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:01,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2024-11-07 02:42:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:01,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2024-11-07 02:42:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 4 proven. 83 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-07 02:42:01,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:42:01,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089735989] [2024-11-07 02:42:01,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089735989] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 02:42:01,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197527938] [2024-11-07 02:42:01,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:42:01,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 02:42:01,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:42:01,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 02:42:01,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 02:42:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:02,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 02:42:02,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:42:03,223 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 79 proven. 6 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-07 02:42:03,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:42:04,206 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 65 proven. 3 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-07 02:42:04,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197527938] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:42:04,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 02:42:04,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2024-11-07 02:42:04,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114268707] [2024-11-07 02:42:04,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 02:42:04,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 02:42:04,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:42:04,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 02:42:04,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2024-11-07 02:42:04,209 INFO L87 Difference]: Start difference. First operand 1235 states and 1689 transitions. Second operand has 25 states, 25 states have (on average 34.32) internal successors, (858), 25 states have internal predecessors, (858), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 02:42:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:42:05,890 INFO L93 Difference]: Finished difference Result 2154 states and 2924 transitions. [2024-11-07 02:42:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 02:42:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 34.32) internal successors, (858), 25 states have internal predecessors, (858), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 347 [2024-11-07 02:42:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:42:05,893 INFO L225 Difference]: With dead ends: 2154 [2024-11-07 02:42:05,893 INFO L226 Difference]: Without dead ends: 1243 [2024-11-07 02:42:05,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 694 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=1830, Unknown=0, NotChecked=0, Total=2162 [2024-11-07 02:42:05,895 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 1087 mSDsluCounter, 6778 mSDsCounter, 0 mSdLazyCounter, 3491 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 7261 SdHoareTripleChecker+Invalid, 3495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 3491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 02:42:05,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 7261 Invalid, 3495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 3491 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 02:42:05,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2024-11-07 02:42:05,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1201. [2024-11-07 02:42:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1180 states have (on average 1.3372881355932202) internal successors, (1578), 1180 states have internal predecessors, (1578), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 02:42:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 1616 transitions. [2024-11-07 02:42:05,933 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 1616 transitions. Word has length 347 [2024-11-07 02:42:05,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:42:05,933 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 1616 transitions. [2024-11-07 02:42:05,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 34.32) internal successors, (858), 25 states have internal predecessors, (858), 5 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2024-11-07 02:42:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 1616 transitions. [2024-11-07 02:42:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-11-07 02:42:05,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:42:05,938 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:42:05,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-07 02:42:06,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 02:42:06,139 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:42:06,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:42:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash -353658428, now seen corresponding path program 1 times [2024-11-07 02:42:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:42:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128151904] [2024-11-07 02:42:06,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:42:06,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:42:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:06,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:42:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:06,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 02:42:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 02:42:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:06,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-07 02:42:06,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:06,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-07 02:42:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:06,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 02:42:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-07 02:42:06,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:42:06,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128151904] [2024-11-07 02:42:06,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128151904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:42:06,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:42:06,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 02:42:06,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860238341] [2024-11-07 02:42:06,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:42:06,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 02:42:06,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:42:06,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 02:42:06,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:42:06,688 INFO L87 Difference]: Start difference. First operand 1201 states and 1616 transitions. Second operand has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:42:06,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:42:06,723 INFO L93 Difference]: Finished difference Result 1938 states and 2612 transitions. [2024-11-07 02:42:06,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:42:06,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 349 [2024-11-07 02:42:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:42:06,726 INFO L225 Difference]: With dead ends: 1938 [2024-11-07 02:42:06,726 INFO L226 Difference]: Without dead ends: 1289 [2024-11-07 02:42:06,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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 02:42:06,727 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 16 mSDsluCounter, 1620 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 2164 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:42:06,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 2164 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:42:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1289 states. [2024-11-07 02:42:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1289 to 1289. [2024-11-07 02:42:06,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1268 states have (on average 1.3422712933753944) internal successors, (1702), 1268 states have internal predecessors, (1702), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 02:42:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1740 transitions. [2024-11-07 02:42:06,746 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1740 transitions. Word has length 349 [2024-11-07 02:42:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:42:06,746 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1740 transitions. [2024-11-07 02:42:06,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 58.4) internal successors, (292), 5 states have internal predecessors, (292), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-07 02:42:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1740 transitions. [2024-11-07 02:42:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-07 02:42:06,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:42:06,749 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:42:06,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-07 02:42:06,750 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:42:06,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:42:06,750 INFO L85 PathProgramCache]: Analyzing trace with hash 311266864, now seen corresponding path program 1 times [2024-11-07 02:42:06,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:42:06,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812393355] [2024-11-07 02:42:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:42:06,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:42:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:08,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 02:42:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:08,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-07 02:42:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:08,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 02:42:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:08,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2024-11-07 02:42:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2024-11-07 02:42:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:08,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2024-11-07 02:42:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:42:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-11-07 02:42:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:42:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812393355] [2024-11-07 02:42:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812393355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:42:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:42:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:42:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541150409] [2024-11-07 02:42:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:42:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:42:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:42:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:42:08,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:42:08,319 INFO L87 Difference]: Start difference. First operand 1289 states and 1740 transitions. Second operand has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:42:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:42:09,158 INFO L93 Difference]: Finished difference Result 2859 states and 3817 transitions. [2024-11-07 02:42:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 02:42:09,159 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 350 [2024-11-07 02:42:09,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:42:09,162 INFO L225 Difference]: With dead ends: 2859 [2024-11-07 02:42:09,162 INFO L226 Difference]: Without dead ends: 2070 [2024-11-07 02:42:09,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2024-11-07 02:42:09,164 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 879 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 3274 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 02:42:09,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 3274 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 02:42:09,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2024-11-07 02:42:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 1299. [2024-11-07 02:42:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1278 states have (on average 1.3435054773082942) internal successors, (1717), 1278 states have internal predecessors, (1717), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 02:42:09,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1755 transitions. [2024-11-07 02:42:09,192 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1755 transitions. Word has length 350 [2024-11-07 02:42:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:42:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 1299 states and 1755 transitions. [2024-11-07 02:42:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.22222222222222) internal successors, (281), 9 states have internal predecessors, (281), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-07 02:42:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1755 transitions. [2024-11-07 02:42:09,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-07 02:42:09,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:42:09,195 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 02:42:09,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-07 02:42:09,196 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:42:09,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:42:09,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2128409872, now seen corresponding path program 1 times [2024-11-07 02:42:09,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:42:09,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137107289] [2024-11-07 02:42:09,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:42:09,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:42:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat