./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/hardness-nfm22/hardness_variablewrapping_normal_file-32.i', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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', '32bit', '--witnessprinter.graph.data.programhash', 'e3899bbf26c9ae805c010051d9160ff07bcd5d68dc29e4a0284125764e39562e'] 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/hardness-nfm22/hardness_variablewrapping_normal_file-32.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash e3899bbf26c9ae805c010051d9160ff07bcd5d68dc29e4a0284125764e39562e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 10:00:38,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 10:00:38,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 10:00:38,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 10:00:38,530 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 10:00:38,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 10:00:38,566 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 10:00:38,566 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 10:00:38,567 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 10:00:38,567 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 10:00:38,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 10:00:38,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 10:00:38,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 10:00:38,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 10:00:38,569 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 10:00:38,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 10:00:38,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 10:00:38,569 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 10:00:38,569 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 10:00:38,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 10:00:38,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 10:00:38,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 10:00:38,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 10:00:38,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 10:00:38,570 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 10:00:38,571 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 10:00:38,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 10:00:38,571 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 10:00:38,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 10:00:38,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 10:00:38,572 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 10:00:38,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 10:00:38,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:00:38,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 10:00:38,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 10:00:38,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 10:00:38,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 10:00:38,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 10:00:38,573 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 10:00:38,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 10:00:38,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 10:00:38,574 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 10:00:38,574 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3899bbf26c9ae805c010051d9160ff07bcd5d68dc29e4a0284125764e39562e [2024-11-07 10:00:38,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 10:00:38,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 10:00:38,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 10:00:38,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 10:00:38,927 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 10:00:38,929 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2024-11-07 10:00:40,272 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 10:00:40,510 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 10:00:40,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-32.i [2024-11-07 10:00:40,518 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70315af38/e653e001a1444f0b987c97fc9e0e6781/FLAGc4ce798aa [2024-11-07 10:00:40,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/70315af38/e653e001a1444f0b987c97fc9e0e6781 [2024-11-07 10:00:40,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 10:00:40,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 10:00:40,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 10:00:40,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 10:00:40,865 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 10:00:40,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:00:40" (1/1) ... [2024-11-07 10:00:40,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f6bc8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:40, skipping insertion in model container [2024-11-07 10:00:40,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 10:00:40" (1/1) ... [2024-11-07 10:00:40,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 10:00:41,003 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/hardness-nfm22/hardness_variablewrapping_normal_file-32.i[913,926] [2024-11-07 10:00:41,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:00:41,067 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 10:00:41,078 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/hardness-nfm22/hardness_variablewrapping_normal_file-32.i[913,926] [2024-11-07 10:00:41,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 10:00:41,115 INFO L204 MainTranslator]: Completed translation [2024-11-07 10:00:41,116 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41 WrapperNode [2024-11-07 10:00:41,116 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 10:00:41,118 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 10:00:41,118 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 10:00:41,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 10:00:41,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,133 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,184 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-11-07 10:00:41,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 10:00:41,185 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 10:00:41,185 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 10:00:41,185 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 10:00:41,195 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,200 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,219 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 10:00:41,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,247 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 10:00:41,251 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 10:00:41,251 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 10:00:41,251 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 10:00:41,252 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (1/1) ... [2024-11-07 10:00:41,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 10:00:41,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:00:41,285 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 10:00:41,289 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 10:00:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 10:00:41,312 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 10:00:41,312 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 10:00:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 10:00:41,313 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 10:00:41,313 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 10:00:41,392 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 10:00:41,394 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 10:00:41,725 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 10:00:41,725 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 10:00:41,737 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 10:00:41,738 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 10:00:41,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:00:41 BoogieIcfgContainer [2024-11-07 10:00:41,738 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 10:00:41,740 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 10:00:41,740 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 10:00:41,744 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 10:00:41,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 10:00:40" (1/3) ... [2024-11-07 10:00:41,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c9c0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:00:41, skipping insertion in model container [2024-11-07 10:00:41,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 10:00:41" (2/3) ... [2024-11-07 10:00:41,745 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45c9c0e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 10:00:41, skipping insertion in model container [2024-11-07 10:00:41,745 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 10:00:41" (3/3) ... [2024-11-07 10:00:41,746 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-32.i [2024-11-07 10:00:41,769 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 10:00:41,769 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 10:00:41,831 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 10:00:41,846 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;@68980824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 10:00:41,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 10:00:41,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 10:00:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:00:41,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:00:41,863 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:41,864 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:00:41,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:00:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash 385929245, now seen corresponding path program 1 times [2024-11-07 10:00:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:00:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787365504] [2024-11-07 10:00:41,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:00:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:00:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:00:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:00:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:00:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:00:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:00:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:00:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:00:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:00:42,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:00:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:00:42,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:00:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:00:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:00:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:00:42,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:00:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:00:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:00:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:00:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:42,632 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:00:42,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:00:42,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787365504] [2024-11-07 10:00:42,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787365504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:00:42,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:00:42,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:00:42,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793310108] [2024-11-07 10:00:42,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:00:42,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:00:42,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:00:42,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:00:42,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:00:42,667 INFO L87 Difference]: Start difference. First operand has 55 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 35 states have internal predecessors, (46), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:42,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:00:42,894 INFO L93 Difference]: Finished difference Result 162 states and 287 transitions. [2024-11-07 10:00:42,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 10:00:42,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 113 [2024-11-07 10:00:42,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:00:42,906 INFO L225 Difference]: With dead ends: 162 [2024-11-07 10:00:42,906 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 10:00:42,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 10:00:42,913 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 72 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 10:00:42,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 206 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 10:00:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 10:00:42,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 97. [2024-11-07 10:00:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 58 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:00:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 145 transitions. [2024-11-07 10:00:42,998 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 145 transitions. Word has length 113 [2024-11-07 10:00:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:00:43,001 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 145 transitions. [2024-11-07 10:00:43,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 145 transitions. [2024-11-07 10:00:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 10:00:43,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:00:43,007 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:43,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 10:00:43,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:00:43,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:00:43,009 INFO L85 PathProgramCache]: Analyzing trace with hash -294129125, now seen corresponding path program 1 times [2024-11-07 10:00:43,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:00:43,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818406461] [2024-11-07 10:00:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:00:43,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:00:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:00:47,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:00:47,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:00:47,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:00:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:00:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:00:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:00:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:00:47,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:00:47,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:00:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:00:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:00:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:00:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:00:47,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:00:47,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:00:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:00:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:00:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:47,557 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:00:47,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:00:47,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818406461] [2024-11-07 10:00:47,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818406461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:00:47,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:00:47,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:00:47,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782143123] [2024-11-07 10:00:47,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:00:47,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:00:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:00:47,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:00:47,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:00:47,561 INFO L87 Difference]: Start difference. First operand 97 states and 145 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:00:49,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:00:49,116 INFO L93 Difference]: Finished difference Result 121 states and 171 transitions. [2024-11-07 10:00:49,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:00:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-07 10:00:49,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:00:49,119 INFO L225 Difference]: With dead ends: 121 [2024-11-07 10:00:49,119 INFO L226 Difference]: Without dead ends: 119 [2024-11-07 10:00:49,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2024-11-07 10:00:49,120 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 165 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:00:49,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 380 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:00:49,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-07 10:00:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2024-11-07 10:00:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.253968253968254) internal successors, (79), 63 states have internal predecessors, (79), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:00:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2024-11-07 10:00:49,136 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 113 [2024-11-07 10:00:49,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:00:49,137 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 151 transitions. [2024-11-07 10:00:49,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 10:00:49,137 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 151 transitions. [2024-11-07 10:00:49,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 10:00:49,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:00:49,139 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:49,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 10:00:49,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:00:49,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:00:49,140 INFO L85 PathProgramCache]: Analyzing trace with hash -933556435, now seen corresponding path program 1 times [2024-11-07 10:00:49,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:00:49,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254862618] [2024-11-07 10:00:49,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:00:49,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:00:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:00:51,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:00:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:00:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:00:51,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:00:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:00:51,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:00:51,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:00:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:00:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:00:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:00:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:00:51,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:00:51,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:00:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:00:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:00:51,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:00:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:00:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:51,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:00:51,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:00:51,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254862618] [2024-11-07 10:00:51,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254862618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:00:51,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:00:51,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:00:51,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450389045] [2024-11-07 10:00:51,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:00:51,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:00:51,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:00:51,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:00:51,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:00:51,765 INFO L87 Difference]: Start difference. First operand 102 states and 151 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:00:53,184 INFO L93 Difference]: Finished difference Result 151 states and 208 transitions. [2024-11-07 10:00:53,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 10:00:53,186 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-07 10:00:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:00:53,188 INFO L225 Difference]: With dead ends: 151 [2024-11-07 10:00:53,190 INFO L226 Difference]: Without dead ends: 149 [2024-11-07 10:00:53,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:00:53,191 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:00:53,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 399 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:00:53,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-07 10:00:53,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 109. [2024-11-07 10:00:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:00:53,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-07 10:00:53,214 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 114 [2024-11-07 10:00:53,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:00:53,215 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-07 10:00:53,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-07 10:00:53,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-07 10:00:53,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:00:53,217 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:53,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 10:00:53,217 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:00:53,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:00:53,217 INFO L85 PathProgramCache]: Analyzing trace with hash 36486516, now seen corresponding path program 1 times [2024-11-07 10:00:53,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:00:53,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535504072] [2024-11-07 10:00:53,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:00:53,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:00:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:00:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:00:54,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:00:54,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:00:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:00:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:00:54,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:00:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:00:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:00:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:00:54,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:00:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:00:54,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:00:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:00:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:00:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:00:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:00:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:00:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:54,714 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:00:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:00:54,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535504072] [2024-11-07 10:00:54,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535504072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:00:54,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:00:54,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 10:00:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775750920] [2024-11-07 10:00:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:00:54,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 10:00:54,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:00:54,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 10:00:54,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 10:00:54,717 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:55,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:00:55,538 INFO L93 Difference]: Finished difference Result 139 states and 194 transitions. [2024-11-07 10:00:55,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 10:00:55,539 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 114 [2024-11-07 10:00:55,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:00:55,541 INFO L225 Difference]: With dead ends: 139 [2024-11-07 10:00:55,542 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 10:00:55,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-07 10:00:55,543 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 126 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:00:55,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 385 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:00:55,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 10:00:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 109. [2024-11-07 10:00:55,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 70 states have internal predecessors, (89), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:00:55,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 161 transitions. [2024-11-07 10:00:55,571 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 161 transitions. Word has length 114 [2024-11-07 10:00:55,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:00:55,572 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 161 transitions. [2024-11-07 10:00:55,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 161 transitions. [2024-11-07 10:00:55,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:00:55,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:00:55,578 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:55,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 10:00:55,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:00:55,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:00:55,579 INFO L85 PathProgramCache]: Analyzing trace with hash 886190736, now seen corresponding path program 1 times [2024-11-07 10:00:55,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:00:55,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553082361] [2024-11-07 10:00:55,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:00:55,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:00:55,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:00:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:00:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:00:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:00:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:00:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:00:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:00:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:00:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:00:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:00:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:00:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:00:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:00:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:00:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:00:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:00:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:00:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:00:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:00:57,940 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:00:57,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:00:57,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553082361] [2024-11-07 10:00:57,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553082361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:00:57,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:00:57,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:00:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606991966] [2024-11-07 10:00:57,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:00:57,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:00:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:00:57,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:00:57,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:00:57,947 INFO L87 Difference]: Start difference. First operand 109 states and 161 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:59,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:00:59,379 INFO L93 Difference]: Finished difference Result 144 states and 201 transitions. [2024-11-07 10:00:59,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-07 10:00:59,380 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-07 10:00:59,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:00:59,382 INFO L225 Difference]: With dead ends: 144 [2024-11-07 10:00:59,382 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 10:00:59,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=484, Unknown=0, NotChecked=0, Total=650 [2024-11-07 10:00:59,387 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 113 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:00:59,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 392 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:00:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 10:00:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 111. [2024-11-07 10:00:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 72 states have internal predecessors, (93), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:00:59,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 165 transitions. [2024-11-07 10:00:59,417 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 165 transitions. Word has length 115 [2024-11-07 10:00:59,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:00:59,417 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 165 transitions. [2024-11-07 10:00:59,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:00:59,418 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 165 transitions. [2024-11-07 10:00:59,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:00:59,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:00:59,419 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:00:59,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 10:00:59,420 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:00:59,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:00:59,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2084428143, now seen corresponding path program 1 times [2024-11-07 10:00:59,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:00:59,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994703222] [2024-11-07 10:00:59,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:00:59,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:00:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:01:00,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:01:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:01:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:01:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:01:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:01:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:01:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:01:00,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:01:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:01:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:01:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:01:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:01:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:01:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:01:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:01:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:01:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:01:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:01:00,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:01:00,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994703222] [2024-11-07 10:01:00,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994703222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:01:00,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:01:00,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 10:01:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816812495] [2024-11-07 10:01:00,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:01:00,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 10:01:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:01:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 10:01:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-07 10:01:00,385 INFO L87 Difference]: Start difference. First operand 111 states and 165 transitions. Second operand has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:01:01,096 INFO L93 Difference]: Finished difference Result 298 states and 422 transitions. [2024-11-07 10:01:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 10:01:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-07 10:01:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:01:01,099 INFO L225 Difference]: With dead ends: 298 [2024-11-07 10:01:01,099 INFO L226 Difference]: Without dead ends: 190 [2024-11-07 10:01:01,100 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:01:01,101 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 197 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:01:01,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 511 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:01:01,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-07 10:01:01,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 121. [2024-11-07 10:01:01,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:01:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-11-07 10:01:01,115 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 115 [2024-11-07 10:01:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:01:01,115 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-11-07 10:01:01,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 11 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-11-07 10:01:01,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-07 10:01:01,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:01:01,117 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:01,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 10:01:01,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:01:01,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:01:01,118 INFO L85 PathProgramCache]: Analyzing trace with hash -309420781, now seen corresponding path program 1 times [2024-11-07 10:01:01,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:01:01,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793396755] [2024-11-07 10:01:01,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:01:01,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:01:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:01:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:01:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:01:03,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:01:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:01:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:01:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:01:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:01:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:01:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:01:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:01:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:01:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:01:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:01:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:01:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:01:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:01:03,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:01:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:01:03,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:01:03,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793396755] [2024-11-07 10:01:03,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793396755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:01:03,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:01:03,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:01:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606751984] [2024-11-07 10:01:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:01:03,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:01:03,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:01:03,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:01:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:01:03,157 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:04,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:01:04,094 INFO L93 Difference]: Finished difference Result 167 states and 227 transitions. [2024-11-07 10:01:04,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 10:01:04,095 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2024-11-07 10:01:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:01:04,097 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:01:04,097 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 10:01:04,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:01:04,098 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 97 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 10:01:04,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 375 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 10:01:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 10:01:04,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 121. [2024-11-07 10:01:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:01:04,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 180 transitions. [2024-11-07 10:01:04,109 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 180 transitions. Word has length 115 [2024-11-07 10:01:04,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:01:04,110 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 180 transitions. [2024-11-07 10:01:04,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:04,110 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 180 transitions. [2024-11-07 10:01:04,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 10:01:04,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:01:04,111 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:04,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 10:01:04,112 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:01:04,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:01:04,112 INFO L85 PathProgramCache]: Analyzing trace with hash -598251145, now seen corresponding path program 1 times [2024-11-07 10:01:04,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:01:04,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034615822] [2024-11-07 10:01:04,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:01:04,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:01:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:01:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:01:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:01:04,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:01:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:01:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:01:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:01:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:01:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:01:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:01:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:01:04,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:01:04,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:01:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:01:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:01:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:01:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:01:04,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:01:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:01:04,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:01:04,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034615822] [2024-11-07 10:01:04,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034615822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:01:04,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:01:04,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:01:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247114924] [2024-11-07 10:01:04,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:01:04,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:01:04,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:01:04,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:01:04,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:01:04,987 INFO L87 Difference]: Start difference. First operand 121 states and 180 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:06,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:01:06,005 INFO L93 Difference]: Finished difference Result 198 states and 263 transitions. [2024-11-07 10:01:06,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 10:01:06,006 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-07 10:01:06,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:01:06,008 INFO L225 Difference]: With dead ends: 198 [2024-11-07 10:01:06,008 INFO L226 Difference]: Without dead ends: 196 [2024-11-07 10:01:06,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=458, Unknown=0, NotChecked=0, Total=600 [2024-11-07 10:01:06,009 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 179 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 10:01:06,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 534 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 10:01:06,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-07 10:01:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 122. [2024-11-07 10:01:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 83 states have internal predecessors, (110), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:01:06,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 182 transitions. [2024-11-07 10:01:06,020 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 182 transitions. Word has length 116 [2024-11-07 10:01:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:01:06,020 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 182 transitions. [2024-11-07 10:01:06,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 182 transitions. [2024-11-07 10:01:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 10:01:06,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:01:06,022 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:06,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 10:01:06,022 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:01:06,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:01:06,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1407597771, now seen corresponding path program 1 times [2024-11-07 10:01:06,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:01:06,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733321249] [2024-11-07 10:01:06,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:01:06,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:01:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:01:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:01:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:01:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:01:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:01:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:01:07,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:01:07,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:01:07,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:01:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:01:07,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:01:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:01:07,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:01:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:01:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:01:07,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:01:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:01:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:01:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:07,373 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:01:07,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:01:07,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733321249] [2024-11-07 10:01:07,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733321249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:01:07,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:01:07,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 10:01:07,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582048498] [2024-11-07 10:01:07,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:01:07,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 10:01:07,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:01:07,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 10:01:07,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-07 10:01:07,375 INFO L87 Difference]: Start difference. First operand 122 states and 182 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:01:08,633 INFO L93 Difference]: Finished difference Result 193 states and 258 transitions. [2024-11-07 10:01:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-07 10:01:08,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-07 10:01:08,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:01:08,635 INFO L225 Difference]: With dead ends: 193 [2024-11-07 10:01:08,635 INFO L226 Difference]: Without dead ends: 191 [2024-11-07 10:01:08,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=255, Invalid=801, Unknown=0, NotChecked=0, Total=1056 [2024-11-07 10:01:08,636 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 191 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:01:08,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 502 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:01:08,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-07 10:01:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 124. [2024-11-07 10:01:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:01:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-07 10:01:08,646 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 116 [2024-11-07 10:01:08,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:01:08,646 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-07 10:01:08,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:08,647 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-07 10:01:08,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-07 10:01:08,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:01:08,648 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:01:08,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 10:01:08,648 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:01:08,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:01:08,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1602400120, now seen corresponding path program 1 times [2024-11-07 10:01:08,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:01:08,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744226991] [2024-11-07 10:01:08,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:01:08,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:01:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:01:10,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:01:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:01:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:01:10,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:01:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:01:10,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:01:10,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:01:10,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:01:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:01:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:01:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:01:10,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:01:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:01:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:01:10,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:01:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:01:10,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:01:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 10:01:10,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:01:10,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744226991] [2024-11-07 10:01:10,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744226991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:01:10,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:01:10,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-07 10:01:10,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464695695] [2024-11-07 10:01:10,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:01:10,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 10:01:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:01:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 10:01:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-07 10:01:10,276 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:11,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:01:11,247 INFO L93 Difference]: Finished difference Result 167 states and 230 transitions. [2024-11-07 10:01:11,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 10:01:11,247 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-07 10:01:11,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:01:11,249 INFO L225 Difference]: With dead ends: 167 [2024-11-07 10:01:11,249 INFO L226 Difference]: Without dead ends: 165 [2024-11-07 10:01:11,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2024-11-07 10:01:11,250 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 101 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 10:01:11,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 415 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 10:01:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-07 10:01:11,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 125. [2024-11-07 10:01:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:01:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 187 transitions. [2024-11-07 10:01:11,259 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 187 transitions. Word has length 117 [2024-11-07 10:01:11,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:01:11,259 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 187 transitions. [2024-11-07 10:01:11,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 10:01:11,260 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 187 transitions. [2024-11-07 10:01:11,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-07 10:01:11,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:01:11,262 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 10:01:11,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 10:01:11,263 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:01:11,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:01:11,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1723789679, now seen corresponding path program 1 times [2024-11-07 10:01:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:01:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180154697] [2024-11-07 10:01:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:01:11,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:01:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:01:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:01:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:01:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:01:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:01:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:01:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:01:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:01:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:01:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:01:11,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:01:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:01:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:01:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:01:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:01:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:01:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:01:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:01:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:01:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 10:01:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 10:01:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 10:01:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 10:01:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:01:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:01:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 10:01:11,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 10:01:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 10:01:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 10:01:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 10:01:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 10:01:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-07 10:01:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 10:01:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 10:01:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 10:01:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 10:01:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:11,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-07 10:01:11,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:01:11,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180154697] [2024-11-07 10:01:11,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180154697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 10:01:11,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 10:01:11,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 10:01:11,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952655880] [2024-11-07 10:01:11,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 10:01:11,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 10:01:11,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 10:01:11,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 10:01:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 10:01:11,410 INFO L87 Difference]: Start difference. First operand 125 states and 187 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 10:01:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 10:01:11,492 INFO L93 Difference]: Finished difference Result 182 states and 271 transitions. [2024-11-07 10:01:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 10:01:11,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 224 [2024-11-07 10:01:11,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 10:01:11,495 INFO L225 Difference]: With dead ends: 182 [2024-11-07 10:01:11,495 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 10:01:11,496 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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 10:01:11,496 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 10:01:11,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 70 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 10:01:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 10:01:11,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-07 10:01:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 79 states have internal predecessors, (102), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 10:01:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 174 transitions. [2024-11-07 10:01:11,512 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 174 transitions. Word has length 224 [2024-11-07 10:01:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 10:01:11,513 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 174 transitions. [2024-11-07 10:01:11,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-11-07 10:01:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 174 transitions. [2024-11-07 10:01:11,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-07 10:01:11,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 10:01:11,517 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-07 10:01:11,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 10:01:11,518 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 10:01:11,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 10:01:11,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1891119247, now seen corresponding path program 1 times [2024-11-07 10:01:11,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 10:01:11,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056259188] [2024-11-07 10:01:11,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:01:11,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 10:01:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 10:01:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 10:01:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 10:01:13,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 10:01:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 10:01:13,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 10:01:13,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 10:01:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 10:01:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 10:01:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 10:01:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 10:01:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 10:01:13,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 10:01:13,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 10:01:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 10:01:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 10:01:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 10:01:13,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 10:01:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 10:01:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 10:01:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 10:01:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 10:01:13,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 10:01:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 10:01:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-07 10:01:13,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-07 10:01:13,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-07 10:01:13,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-07 10:01:13,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-07 10:01:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-11-07 10:01:13,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2024-11-07 10:01:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2024-11-07 10:01:13,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2024-11-07 10:01:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2024-11-07 10:01:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2024-11-07 10:01:13,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2024-11-07 10:01:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2557 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2024-11-07 10:01:13,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 10:01:13,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056259188] [2024-11-07 10:01:13,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056259188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 10:01:13,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267614837] [2024-11-07 10:01:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 10:01:13,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 10:01:13,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 10:01:13,286 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 10:01:13,287 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 10:01:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 10:01:13,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 10:01:13,423 INFO L278 TraceCheckSpWp]: Computing forward predicates...