./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.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_fillercode_fillercodestructure_filler-pr-ci_file-11.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', 'b879c59582ac4a49c0e2ecf86f8757548b6309c2a4170b8da4007bca733fddea'] 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_fillercode_fillercodestructure_filler-pr-ci_file-11.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 b879c59582ac4a49c0e2ecf86f8757548b6309c2a4170b8da4007bca733fddea --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:15:53,117 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:15:53,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:15:53,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:15:53,257 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:15:53,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:15:53,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:15:53,297 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:15:53,297 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:15:53,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:15:53,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:15:53,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:15:53,298 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:15:53,298 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:15:53,298 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:15:53,298 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:15:53,298 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:15:53,298 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:15:53,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:15:53,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:15:53,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:15:53,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:15:53,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:15:53,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:15:53,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:15:53,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:15:53,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:15:53,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:15:53,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:15:53,303 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:15:53,304 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:15:53,304 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 -> b879c59582ac4a49c0e2ecf86f8757548b6309c2a4170b8da4007bca733fddea [2024-11-07 06:15:53,848 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:15:53,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:15:53,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:15:53,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:15:53,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:15:53,885 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2024-11-07 06:15:55,432 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:15:55,843 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:15:55,844 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2024-11-07 06:15:55,863 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e07832f27/5997807d370342b3919e8c5c46756fb4/FLAG368fd1b9f [2024-11-07 06:15:55,889 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e07832f27/5997807d370342b3919e8c5c46756fb4 [2024-11-07 06:15:55,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:15:55,894 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:15:55,895 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:15:55,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:15:55,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:15:55,901 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:15:55" (1/1) ... [2024-11-07 06:15:55,903 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de45e86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:55, skipping insertion in model container [2024-11-07 06:15:55,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:15:55" (1/1) ... [2024-11-07 06:15:55,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:15:56,075 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_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2024-11-07 06:15:56,150 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:15:56,169 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:15:56,182 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_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2024-11-07 06:15:56,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:15:56,239 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:15:56,242 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56 WrapperNode [2024-11-07 06:15:56,242 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:15:56,243 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:15:56,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:15:56,244 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:15:56,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,271 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,309 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 211 [2024-11-07 06:15:56,309 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:15:56,310 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:15:56,310 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:15:56,310 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:15:56,318 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,321 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,335 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 06:15:56,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:15:56,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:15:56,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:15:56,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:15:56,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (1/1) ... [2024-11-07 06:15:56,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:15:56,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:15:56,392 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 06:15:56,395 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 06:15:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:15:56,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:15:56,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:15:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:15:56,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:15:56,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:15:56,492 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:15:56,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:15:57,137 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 06:15:57,138 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:15:57,160 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:15:57,161 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:15:57,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:15:57 BoogieIcfgContainer [2024-11-07 06:15:57,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:15:57,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:15:57,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:15:57,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:15:57,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:15:55" (1/3) ... [2024-11-07 06:15:57,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280c2c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:15:57, skipping insertion in model container [2024-11-07 06:15:57,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:15:56" (2/3) ... [2024-11-07 06:15:57,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280c2c0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:15:57, skipping insertion in model container [2024-11-07 06:15:57,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:15:57" (3/3) ... [2024-11-07 06:15:57,192 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2024-11-07 06:15:57,208 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:15:57,209 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:15:57,283 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:15:57,298 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;@6b6e884a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:15:57,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:15:57,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:15:57,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:15:57,325 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:57,327 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:57,327 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:57,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1318438774, now seen corresponding path program 1 times [2024-11-07 06:15:57,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:15:57,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905835704] [2024-11-07 06:15:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:57,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:15:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:15:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:15:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:15:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:15:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:15:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:15:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:15:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:15:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:15:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:15:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:15:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:15:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:15:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:15:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:15:57,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:15:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:15:57,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:15:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:15:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:15:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:15:57,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:15:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:15:57,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:15:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:57,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:15:57,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:15:57,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905835704] [2024-11-07 06:15:57,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905835704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:15:57,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:15:57,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:15:57,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677884484] [2024-11-07 06:15:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:15:57,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:15:57,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:15:57,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:15:57,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:15:57,959 INFO L87 Difference]: Start difference. First operand has 88 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:15:57,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:15:57,995 INFO L93 Difference]: Finished difference Result 169 states and 298 transitions. [2024-11-07 06:15:57,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:15:57,998 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2024-11-07 06:15:57,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:15:58,008 INFO L225 Difference]: With dead ends: 169 [2024-11-07 06:15:58,009 INFO L226 Difference]: Without dead ends: 84 [2024-11-07 06:15:58,013 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:15:58,016 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:15:58,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:15:58,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-07 06:15:58,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-07 06:15:58,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:15:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 131 transitions. [2024-11-07 06:15:58,061 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 131 transitions. Word has length 156 [2024-11-07 06:15:58,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:15:58,064 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 131 transitions. [2024-11-07 06:15:58,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:15:58,064 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 131 transitions. [2024-11-07 06:15:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 06:15:58,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:58,070 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:58,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:15:58,070 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:58,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 346370704, now seen corresponding path program 1 times [2024-11-07 06:15:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:15:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300506823] [2024-11-07 06:15:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:58,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:15:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:15:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:15:58,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:15:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:15:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:15:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:15:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:15:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:15:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:15:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:15:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:15:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:15:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:15:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:15:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:15:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:15:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:15:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:15:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:58,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:15:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:59,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:15:59,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:59,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:15:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:59,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:15:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:59,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:15:59,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:59,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:15:59,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:15:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:15:59,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:15:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300506823] [2024-11-07 06:15:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300506823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:15:59,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:15:59,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:15:59,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212922858] [2024-11-07 06:15:59,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:15:59,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:15:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:15:59,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:15:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:15:59,047 INFO L87 Difference]: Start difference. First operand 84 states and 131 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:15:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:15:59,205 INFO L93 Difference]: Finished difference Result 210 states and 326 transitions. [2024-11-07 06:15:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:15:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2024-11-07 06:15:59,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:15:59,208 INFO L225 Difference]: With dead ends: 210 [2024-11-07 06:15:59,208 INFO L226 Difference]: Without dead ends: 129 [2024-11-07 06:15:59,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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 06:15:59,214 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 57 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:15:59,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 372 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:15:59,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-07 06:15:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2024-11-07 06:15:59,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 95 states have (on average 1.4631578947368422) internal successors, (139), 96 states have internal predecessors, (139), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:15:59,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 195 transitions. [2024-11-07 06:15:59,245 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 195 transitions. Word has length 158 [2024-11-07 06:15:59,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:15:59,245 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 195 transitions. [2024-11-07 06:15:59,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:15:59,246 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 195 transitions. [2024-11-07 06:15:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:15:59,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:15:59,252 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:15:59,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:15:59,253 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:15:59,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:15:59,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2090213091, now seen corresponding path program 1 times [2024-11-07 06:15:59,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:15:59,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797031877] [2024-11-07 06:15:59,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:15:59,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:15:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:00,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:00,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:16:00,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:00,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797031877] [2024-11-07 06:16:00,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797031877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:00,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:00,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:16:00,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784843421] [2024-11-07 06:16:00,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:00,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:16:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:16:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:00,262 INFO L87 Difference]: Start difference. First operand 126 states and 195 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:00,327 INFO L93 Difference]: Finished difference Result 304 states and 471 transitions. [2024-11-07 06:16:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:16:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-07 06:16:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:00,331 INFO L225 Difference]: With dead ends: 304 [2024-11-07 06:16:00,331 INFO L226 Difference]: Without dead ends: 181 [2024-11-07 06:16:00,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:00,333 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 83 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:00,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 348 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-07 06:16:00,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 155. [2024-11-07 06:16:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.4838709677419355) internal successors, (184), 125 states have internal predecessors, (184), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 06:16:00,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 240 transitions. [2024-11-07 06:16:00,349 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 240 transitions. Word has length 159 [2024-11-07 06:16:00,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:00,349 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 240 transitions. [2024-11-07 06:16:00,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 240 transitions. [2024-11-07 06:16:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:16:00,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:00,352 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:16:00,352 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:00,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:00,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1832047653, now seen corresponding path program 1 times [2024-11-07 06:16:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268951541] [2024-11-07 06:16:00,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:00,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:00,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:00,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:00,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:00,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:16:00,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:00,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268951541] [2024-11-07 06:16:00,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268951541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:00,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:00,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:16:00,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633005626] [2024-11-07 06:16:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:00,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:16:00,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:00,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:16:00,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:00,783 INFO L87 Difference]: Start difference. First operand 155 states and 240 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:01,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:01,014 INFO L93 Difference]: Finished difference Result 450 states and 702 transitions. [2024-11-07 06:16:01,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:16:01,017 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-07 06:16:01,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:01,019 INFO L225 Difference]: With dead ends: 450 [2024-11-07 06:16:01,019 INFO L226 Difference]: Without dead ends: 298 [2024-11-07 06:16:01,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:16:01,021 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 99 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:01,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 445 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:16:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-07 06:16:01,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 199. [2024-11-07 06:16:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 143 states have (on average 1.4195804195804196) internal successors, (203), 144 states have internal predecessors, (203), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 06:16:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 307 transitions. [2024-11-07 06:16:01,054 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 307 transitions. Word has length 159 [2024-11-07 06:16:01,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:01,054 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 307 transitions. [2024-11-07 06:16:01,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:01,055 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 307 transitions. [2024-11-07 06:16:01,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 06:16:01,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:01,057 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:01,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:16:01,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:01,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:01,058 INFO L85 PathProgramCache]: Analyzing trace with hash 342983884, now seen corresponding path program 1 times [2024-11-07 06:16:01,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:01,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119473968] [2024-11-07 06:16:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:01,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:01,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:16:01,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119473968] [2024-11-07 06:16:01,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119473968] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:01,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537223200] [2024-11-07 06:16:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:01,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:01,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:01,542 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 06:16:01,544 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 06:16:01,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:01,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 06:16:01,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:02,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 699 proven. 69 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-07 06:16:02,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:02,506 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-07 06:16:02,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537223200] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:02,506 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:02,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 14 [2024-11-07 06:16:02,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912916788] [2024-11-07 06:16:02,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:02,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 06:16:02,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 06:16:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:16:02,511 INFO L87 Difference]: Start difference. First operand 199 states and 307 transitions. Second operand has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 5 states have call successors, (62), 3 states have call predecessors, (62), 7 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2024-11-07 06:16:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:03,084 INFO L93 Difference]: Finished difference Result 330 states and 487 transitions. [2024-11-07 06:16:03,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 06:16:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 5 states have call successors, (62), 3 states have call predecessors, (62), 7 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) Word has length 160 [2024-11-07 06:16:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:03,087 INFO L225 Difference]: With dead ends: 330 [2024-11-07 06:16:03,087 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 06:16:03,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 359 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=611, Unknown=0, NotChecked=0, Total=870 [2024-11-07 06:16:03,089 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 153 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:03,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 330 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:16:03,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 06:16:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2024-11-07 06:16:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 109 states have (on average 1.275229357798165) internal successors, (139), 109 states have internal predecessors, (139), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:16:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 235 transitions. [2024-11-07 06:16:03,114 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 235 transitions. Word has length 160 [2024-11-07 06:16:03,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:03,115 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 235 transitions. [2024-11-07 06:16:03,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.071428571428571) internal successors, (85), 14 states have internal predecessors, (85), 5 states have call successors, (62), 3 states have call predecessors, (62), 7 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2024-11-07 06:16:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 235 transitions. [2024-11-07 06:16:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 06:16:03,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:03,117 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:03,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:16:03,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:03,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:03,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash 963471889, now seen corresponding path program 1 times [2024-11-07 06:16:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:03,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332288669] [2024-11-07 06:16:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:03,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:03,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:16:03,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:03,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332288669] [2024-11-07 06:16:03,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332288669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:03,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:03,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:16:03,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276455475] [2024-11-07 06:16:03,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:03,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:16:03,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:03,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:16:03,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:03,631 INFO L87 Difference]: Start difference. First operand 166 states and 235 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:03,684 INFO L93 Difference]: Finished difference Result 267 states and 375 transitions. [2024-11-07 06:16:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:16:03,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-11-07 06:16:03,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:03,687 INFO L225 Difference]: With dead ends: 267 [2024-11-07 06:16:03,687 INFO L226 Difference]: Without dead ends: 160 [2024-11-07 06:16:03,687 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 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 06:16:03,688 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 101 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:03,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 260 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:03,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-07 06:16:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-07 06:16:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.198019801980198) internal successors, (121), 101 states have internal predecessors, (121), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:16:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 217 transitions. [2024-11-07 06:16:03,712 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 217 transitions. Word has length 160 [2024-11-07 06:16:03,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:03,713 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 217 transitions. [2024-11-07 06:16:03,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:03,713 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 217 transitions. [2024-11-07 06:16:03,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 06:16:03,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:03,714 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:03,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:16:03,715 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:03,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:03,715 INFO L85 PathProgramCache]: Analyzing trace with hash -918112138, now seen corresponding path program 1 times [2024-11-07 06:16:03,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:03,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862192803] [2024-11-07 06:16:03,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:03,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:03,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:04,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:04,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:16:04,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862192803] [2024-11-07 06:16:04,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862192803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:04,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:04,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:16:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472372905] [2024-11-07 06:16:04,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:04,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:16:04,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:04,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:16:04,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:04,021 INFO L87 Difference]: Start difference. First operand 160 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:04,084 INFO L93 Difference]: Finished difference Result 259 states and 356 transitions. [2024-11-07 06:16:04,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:16:04,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2024-11-07 06:16:04,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:04,086 INFO L225 Difference]: With dead ends: 259 [2024-11-07 06:16:04,086 INFO L226 Difference]: Without dead ends: 162 [2024-11-07 06:16:04,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:04,087 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 0 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:04,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-07 06:16:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2024-11-07 06:16:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 103 states have (on average 1.203883495145631) internal successors, (124), 103 states have internal predecessors, (124), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:16:04,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 220 transitions. [2024-11-07 06:16:04,110 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 220 transitions. Word has length 161 [2024-11-07 06:16:04,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:04,111 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 220 transitions. [2024-11-07 06:16:04,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:04,111 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 220 transitions. [2024-11-07 06:16:04,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 06:16:04,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:04,113 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:04,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:16:04,113 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:04,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1442989916, now seen corresponding path program 1 times [2024-11-07 06:16:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:04,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727204561] [2024-11-07 06:16:04,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:04,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:04,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:04,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:04,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:16:04,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:04,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727204561] [2024-11-07 06:16:04,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727204561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:04,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:04,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:16:04,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343926789] [2024-11-07 06:16:04,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:04,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:16:04,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:04,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:16:04,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:16:04,953 INFO L87 Difference]: Start difference. First operand 162 states and 220 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:05,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:05,579 INFO L93 Difference]: Finished difference Result 437 states and 596 transitions. [2024-11-07 06:16:05,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:16:05,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2024-11-07 06:16:05,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:05,582 INFO L225 Difference]: With dead ends: 437 [2024-11-07 06:16:05,582 INFO L226 Difference]: Without dead ends: 338 [2024-11-07 06:16:05,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:16:05,587 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 185 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:05,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 331 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:16:05,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-07 06:16:05,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 263. [2024-11-07 06:16:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 175 states have (on average 1.2514285714285713) internal successors, (219), 175 states have internal predecessors, (219), 72 states have call successors, (72), 15 states have call predecessors, (72), 15 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 06:16:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 363 transitions. [2024-11-07 06:16:05,648 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 363 transitions. Word has length 162 [2024-11-07 06:16:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:05,651 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 363 transitions. [2024-11-07 06:16:05,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 363 transitions. [2024-11-07 06:16:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 06:16:05,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:05,653 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:05,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 06:16:05,653 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:05,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1660491767, now seen corresponding path program 1 times [2024-11-07 06:16:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:05,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158260286] [2024-11-07 06:16:05,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:06,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:06,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:06,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:06,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:06,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:06,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:06,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:16:06,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:06,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158260286] [2024-11-07 06:16:06,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158260286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:06,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128323699] [2024-11-07 06:16:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:06,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:06,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:06,183 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:16:06,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 06:16:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:06,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 06:16:06,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:06,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-07 06:16:06,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:16:07,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128323699] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:07,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:07,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 14 [2024-11-07 06:16:07,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304745591] [2024-11-07 06:16:07,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 06:16:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:07,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 06:16:07,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:16:07,146 INFO L87 Difference]: Start difference. First operand 263 states and 363 transitions. Second operand has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-11-07 06:16:07,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:07,850 INFO L93 Difference]: Finished difference Result 603 states and 825 transitions. [2024-11-07 06:16:07,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 06:16:07,851 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) Word has length 162 [2024-11-07 06:16:07,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:07,854 INFO L225 Difference]: With dead ends: 603 [2024-11-07 06:16:07,857 INFO L226 Difference]: Without dead ends: 403 [2024-11-07 06:16:07,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2024-11-07 06:16:07,859 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 400 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:07,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 699 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:16:07,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-07 06:16:07,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 327. [2024-11-07 06:16:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 223 states have (on average 1.251121076233184) internal successors, (279), 224 states have internal predecessors, (279), 82 states have call successors, (82), 21 states have call predecessors, (82), 21 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 06:16:07,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 443 transitions. [2024-11-07 06:16:07,934 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 443 transitions. Word has length 162 [2024-11-07 06:16:07,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:07,934 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 443 transitions. [2024-11-07 06:16:07,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 8.285714285714286) internal successors, (116), 14 states have internal predecessors, (116), 6 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 6 states have call predecessors, (72), 6 states have call successors, (72) [2024-11-07 06:16:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 443 transitions. [2024-11-07 06:16:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 06:16:07,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:07,936 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:07,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 06:16:08,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:08,138 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:08,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash 297570304, now seen corresponding path program 1 times [2024-11-07 06:16:08,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998069079] [2024-11-07 06:16:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:08,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:08,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:16:08,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998069079] [2024-11-07 06:16:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998069079] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623649987] [2024-11-07 06:16:08,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:08,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:08,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:08,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 06:16:08,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 06:16:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:08,756 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 06:16:08,760 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:09,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 578 proven. 72 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2024-11-07 06:16:09,465 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:09,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 33 proven. 36 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:16:09,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623649987] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:09,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:09,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 5] total 12 [2024-11-07 06:16:09,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974755386] [2024-11-07 06:16:09,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:09,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 06:16:09,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:09,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 06:16:09,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:16:09,902 INFO L87 Difference]: Start difference. First operand 327 states and 443 transitions. Second operand has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-07 06:16:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:10,412 INFO L93 Difference]: Finished difference Result 619 states and 829 transitions. [2024-11-07 06:16:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 06:16:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) Word has length 163 [2024-11-07 06:16:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:10,418 INFO L225 Difference]: With dead ends: 619 [2024-11-07 06:16:10,418 INFO L226 Difference]: Without dead ends: 359 [2024-11-07 06:16:10,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:16:10,423 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 175 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:10,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 298 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:16:10,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-07 06:16:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 343. [2024-11-07 06:16:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 235 states have (on average 1.2297872340425533) internal successors, (289), 236 states have internal predecessors, (289), 82 states have call successors, (82), 25 states have call predecessors, (82), 25 states have return successors, (82), 81 states have call predecessors, (82), 82 states have call successors, (82) [2024-11-07 06:16:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 453 transitions. [2024-11-07 06:16:10,502 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 453 transitions. Word has length 163 [2024-11-07 06:16:10,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:10,502 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 453 transitions. [2024-11-07 06:16:10,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.0) internal successors, (96), 11 states have internal predecessors, (96), 5 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (51), 5 states have call predecessors, (51), 5 states have call successors, (51) [2024-11-07 06:16:10,503 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 453 transitions. [2024-11-07 06:16:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 06:16:10,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:10,506 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:10,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 06:16:10,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:10,708 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:10,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:10,708 INFO L85 PathProgramCache]: Analyzing trace with hash -982293374, now seen corresponding path program 1 times [2024-11-07 06:16:10,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:10,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529731979] [2024-11-07 06:16:10,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:10,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:10,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:12,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:12,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:12,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 54 proven. 78 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-07 06:16:12,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:12,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529731979] [2024-11-07 06:16:12,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529731979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:12,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42225052] [2024-11-07 06:16:12,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:12,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:12,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:12,769 INFO L229 MonitoredProcess]: Starting monitored process 5 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 06:16:12,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 06:16:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:13,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-07 06:16:13,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 456 proven. 321 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2024-11-07 06:16:15,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 84 proven. 285 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2024-11-07 06:16:18,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42225052] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:18,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:18,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 28, 22] total 57 [2024-11-07 06:16:18,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228091489] [2024-11-07 06:16:18,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:18,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-07 06:16:18,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:18,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-07 06:16:18,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=674, Invalid=2518, Unknown=0, NotChecked=0, Total=3192 [2024-11-07 06:16:18,334 INFO L87 Difference]: Start difference. First operand 343 states and 453 transitions. Second operand has 57 states, 53 states have (on average 2.849056603773585) internal successors, (151), 51 states have internal predecessors, (151), 20 states have call successors, (68), 9 states have call predecessors, (68), 16 states have return successors, (69), 18 states have call predecessors, (69), 20 states have call successors, (69) [2024-11-07 06:16:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:36,858 INFO L93 Difference]: Finished difference Result 2086 states and 2571 transitions. [2024-11-07 06:16:36,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2024-11-07 06:16:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 53 states have (on average 2.849056603773585) internal successors, (151), 51 states have internal predecessors, (151), 20 states have call successors, (68), 9 states have call predecessors, (68), 16 states have return successors, (69), 18 states have call predecessors, (69), 20 states have call successors, (69) Word has length 163 [2024-11-07 06:16:36,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:36,880 INFO L225 Difference]: With dead ends: 2086 [2024-11-07 06:16:36,881 INFO L226 Difference]: Without dead ends: 1809 [2024-11-07 06:16:36,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 596 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21263 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=11132, Invalid=41998, Unknown=0, NotChecked=0, Total=53130 [2024-11-07 06:16:36,912 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 5518 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 1547 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5522 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 3641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1547 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:36,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5522 Valid, 1109 Invalid, 3641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1547 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-07 06:16:36,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-07 06:16:37,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 359. [2024-11-07 06:16:37,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 250 states have (on average 1.164) internal successors, (291), 250 states have internal predecessors, (291), 72 states have call successors, (72), 36 states have call predecessors, (72), 36 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 06:16:37,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 435 transitions. [2024-11-07 06:16:37,107 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 435 transitions. Word has length 163 [2024-11-07 06:16:37,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:37,108 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 435 transitions. [2024-11-07 06:16:37,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 53 states have (on average 2.849056603773585) internal successors, (151), 51 states have internal predecessors, (151), 20 states have call successors, (68), 9 states have call predecessors, (68), 16 states have return successors, (69), 18 states have call predecessors, (69), 20 states have call successors, (69) [2024-11-07 06:16:37,112 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 435 transitions. [2024-11-07 06:16:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 06:16:37,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:37,116 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:37,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-07 06:16:37,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 06:16:37,318 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:37,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:37,319 INFO L85 PathProgramCache]: Analyzing trace with hash -941629787, now seen corresponding path program 1 times [2024-11-07 06:16:37,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:37,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872622531] [2024-11-07 06:16:37,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:16:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:16:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:16:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 06:16:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 06:16:38,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 06:16:38,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 06:16:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 06:16:38,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 06:16:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 06:16:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 06:16:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 06:16:38,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 06:16:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 06:16:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 06:16:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 06:16:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 06:16:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:16:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 06:16:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 06:16:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 06:16:38,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-07 06:16:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 06:16:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 06:16:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 63 proven. 69 refuted. 0 times theorem prover too weak. 972 trivial. 0 not checked. [2024-11-07 06:16:38,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:16:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872622531] [2024-11-07 06:16:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872622531] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 06:16:38,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054807041] [2024-11-07 06:16:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:38,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:16:38,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:38,259 INFO L229 MonitoredProcess]: Starting monitored process 6 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 06:16:38,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-07 06:16:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:38,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 06:16:38,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 707 proven. 105 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2024-11-07 06:16:39,388 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 84 proven. 114 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-07 06:16:40,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054807041] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:40,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 06:16:40,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 26 [2024-11-07 06:16:40,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947846967] [2024-11-07 06:16:40,238 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:40,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-07 06:16:40,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:16:40,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-07 06:16:40,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=487, Unknown=0, NotChecked=0, Total=650 [2024-11-07 06:16:40,241 INFO L87 Difference]: Start difference. First operand 359 states and 435 transitions. Second operand has 26 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 9 states have call predecessors, (56), 10 states have call successors, (56) [2024-11-07 06:16:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:41,198 INFO L93 Difference]: Finished difference Result 649 states and 786 transitions. [2024-11-07 06:16:41,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 06:16:41,199 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 9 states have call predecessors, (56), 10 states have call successors, (56) Word has length 163 [2024-11-07 06:16:41,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:41,202 INFO L225 Difference]: With dead ends: 649 [2024-11-07 06:16:41,203 INFO L226 Difference]: Without dead ends: 381 [2024-11-07 06:16:41,205 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=367, Invalid=965, Unknown=0, NotChecked=0, Total=1332 [2024-11-07 06:16:41,206 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 269 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:41,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 474 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:16:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-07 06:16:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 369. [2024-11-07 06:16:41,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 257 states have (on average 1.1517509727626458) internal successors, (296), 257 states have internal predecessors, (296), 72 states have call successors, (72), 39 states have call predecessors, (72), 39 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 06:16:41,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 440 transitions. [2024-11-07 06:16:41,319 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 440 transitions. Word has length 163 [2024-11-07 06:16:41,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:41,321 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 440 transitions. [2024-11-07 06:16:41,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.041666666666667) internal successors, (121), 24 states have internal predecessors, (121), 10 states have call successors, (55), 4 states have call predecessors, (55), 9 states have return successors, (56), 9 states have call predecessors, (56), 10 states have call successors, (56) [2024-11-07 06:16:41,321 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 440 transitions. [2024-11-07 06:16:41,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 06:16:41,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:41,323 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:41,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-07 06:16:41,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 06:16:41,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:41,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -724127936, now seen corresponding path program 1 times [2024-11-07 06:16:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:16:41,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562525960] [2024-11-07 06:16:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:16:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:41,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:16:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:16:41,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:16:41,830 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:16:41,831 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:16:41,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 06:16:41,836 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:16:42,004 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:16:42,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:16:42 BoogieIcfgContainer [2024-11-07 06:16:42,011 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:16:42,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:16:42,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:16:42,012 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:16:42,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:15:57" (3/4) ... [2024-11-07 06:16:42,016 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:16:42,017 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:16:42,018 INFO L158 Benchmark]: Toolchain (without parser) took 46123.78ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 92.7MB in the beginning and 321.3MB in the end (delta: -228.6MB). Peak memory consumption was 194.7MB. Max. memory is 16.1GB. [2024-11-07 06:16:42,019 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:42,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 347.52ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:16:42,019 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.77ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 75.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:42,019 INFO L158 Benchmark]: Boogie Preprocessor took 45.89ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 72.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:16:42,020 INFO L158 Benchmark]: RCFGBuilder took 812.19ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 50.9MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 06:16:42,020 INFO L158 Benchmark]: TraceAbstraction took 44840.32ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 50.4MB in the beginning and 321.4MB in the end (delta: -271.0MB). Peak memory consumption was 144.3MB. Max. memory is 16.1GB. [2024-11-07 06:16:42,020 INFO L158 Benchmark]: Witness Printer took 5.09ms. Allocated memory is still 536.9MB. Free memory was 321.4MB in the beginning and 321.3MB in the end (delta: 167.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:16:42,022 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 347.52ms. Allocated memory is still 117.4MB. Free memory was 92.4MB in the beginning and 78.1MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.77ms. Allocated memory is still 117.4MB. Free memory was 78.1MB in the beginning and 75.7MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.89ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 72.8MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 812.19ms. Allocated memory is still 117.4MB. Free memory was 72.8MB in the beginning and 50.9MB in the end (delta: 21.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 44840.32ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 50.4MB in the beginning and 321.4MB in the end (delta: -271.0MB). Peak memory consumption was 144.3MB. Max. memory is 16.1GB. * Witness Printer took 5.09ms. Allocated memory is still 536.9MB. Free memory was 321.4MB in the beginning and 321.3MB in the end (delta: 167.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of shiftRight at line 118, overapproximation of someUnaryDOUBLEoperation at line 86, overapproximation of someBinaryDOUBLEComparisonOperation at line 184. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] signed char var_1_4 = 5; [L26] signed char var_1_7 = 0; [L27] signed char var_1_8 = 16; [L28] signed char var_1_9 = 4; [L29] unsigned long int var_1_10 = 128; [L30] unsigned long int var_1_11 = 1422462314; [L31] signed short int var_1_12 = 8; [L32] signed short int var_1_15 = -50; [L33] unsigned long int var_1_16 = 1; [L34] unsigned long int var_1_17 = 3609236770; [L35] unsigned long int var_1_18 = 2902762324; [L36] double var_1_19 = 3.8; [L37] double var_1_20 = 255.75; [L38] unsigned short int var_1_21 = 0; [L39] signed char var_1_22 = -8; [L40] signed long int var_1_23 = -32; [L41] unsigned char var_1_25 = 10; [L42] unsigned char var_1_27 = 128; [L43] float var_1_30 = 31.3; [L44] float var_1_32 = 15.25; [L45] double var_1_33 = 128.8; [L46] signed char var_1_34 = 4; [L47] signed char var_1_35 = 1; [L48] unsigned char var_1_36 = 16; [L49] unsigned long int last_1_var_1_10 = 128; [L50] unsigned long int last_1_var_1_16 = 1; [L51] double last_1_var_1_19 = 3.8; VAL [isInitial=0, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L188] isInitial = 1 [L189] FCALL initially() [L190] COND TRUE 1 [L191] CALL updateLastVariables() [L179] last_1_var_1_10 = var_1_10 [L180] last_1_var_1_16 = var_1_16 [L181] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=0, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L191] RET updateLastVariables() [L192] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] CALL assume_abort_if_not(var_1_3 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L145] RET assume_abort_if_not(var_1_3 <= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=0, var_1_8=16, var_1_9=4] [L146] var_1_7 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=16, var_1_9=4] [L147] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=16, var_1_9=4] [L148] CALL assume_abort_if_not(var_1_7 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=16, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=16, var_1_9=4] [L148] RET assume_abort_if_not(var_1_7 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=16, var_1_9=4] [L149] var_1_8 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=4] [L150] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=4] [L151] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=4] [L151] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=4] [L152] var_1_9 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L153] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L154] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L154] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1422462314, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L155] var_1_11 = __VERIFIER_nondet_ulong() [L156] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L156] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L157] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L157] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=3609236770, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L158] var_1_17 = __VERIFIER_nondet_ulong() [L159] CALL assume_abort_if_not(var_1_17 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L159] RET assume_abort_if_not(var_1_17 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L160] CALL assume_abort_if_not(var_1_17 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L160] RET assume_abort_if_not(var_1_17 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=2902762324, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L161] var_1_18 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_18 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L162] RET assume_abort_if_not(var_1_18 >= 2147483647) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L163] CALL assume_abort_if_not(var_1_18 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L163] RET assume_abort_if_not(var_1_18 <= 4294967294) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_20=1023/4, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L164] var_1_20 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L165] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=128, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L166] var_1_27 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_27 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L167] RET assume_abort_if_not(var_1_27 >= 127) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L168] CALL assume_abort_if_not(var_1_27 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L168] RET assume_abort_if_not(var_1_27 <= 254) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_32=61/4, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L169] var_1_32 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L170] RET assume_abort_if_not((var_1_32 >= -461168.6018427382800e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 4611686.018427382800e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=4, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L171] var_1_34 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L172] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L173] CALL assume_abort_if_not(var_1_34 <= 5) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L173] RET assume_abort_if_not(var_1_34 <= 5) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=1, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L174] var_1_35 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L175] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L176] CALL assume_abort_if_not(var_1_35 <= 4) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L176] RET assume_abort_if_not(var_1_35 <= 4) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L192] RET updateVariables() [L193] CALL step() [L55] unsigned long int stepLocal_1 = last_1_var_1_16; [L56] unsigned long int stepLocal_0 = last_1_var_1_16; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, stepLocal_1=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L57] COND TRUE stepLocal_1 != last_1_var_1_10 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_0=1, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L58] COND FALSE !(var_1_8 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L66] COND TRUE var_1_27 >= (var_1_7 + var_1_7) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=16, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L67] COND TRUE (-0.95f * ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > var_1_20 [L68] var_1_36 = (var_1_27 - var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=5, var_1_7=3, var_1_8=2, var_1_9=7] [L77] COND TRUE var_1_12 == var_1_12 [L78] var_1_4 = ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L80] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=128, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=19/5, var_1_1=1, var_1_21=0, var_1_22=-8, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L83] var_1_1 = (var_1_2 || (! var_1_3)) [L84] var_1_22 = ((((-25) < 0 ) ? -(-25) : (-25))) [L85] var_1_10 = (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7)) [L86] var_1_19 = ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4))) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L87] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=-50, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L88] COND FALSE !(var_1_19 >= var_1_19) [L93] var_1_15 = var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L98] COND TRUE var_1_11 > var_1_12 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=-32, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L99] COND FALSE !((~ var_1_11) <= 128) [L102] var_1_23 = var_1_12 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=1, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L105] COND TRUE var_1_19 != var_1_19 [L106] var_1_16 = (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L114] unsigned char stepLocal_2 = var_1_1; VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, stepLocal_2=1, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L115] COND FALSE !((var_1_16 == (var_1_8 - var_1_9)) && stepLocal_2) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L118] EXPR var_1_9 >> var_1_7 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L118] EXPR ((var_1_18) < ((var_1_9 >> var_1_7))) ? (var_1_18) : ((var_1_9 >> var_1_7)) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=10, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L118] COND TRUE var_1_9 <= ((((var_1_18) < ((var_1_9 >> var_1_7))) ? (var_1_18) : ((var_1_9 >> var_1_7)))) [L119] var_1_25 = (var_1_27 - var_1_7) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=251, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L125] COND TRUE var_1_16 >= var_1_16 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=251, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L126] EXPR var_1_27 >> (var_1_34 + var_1_35) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=251, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=644/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L126] COND FALSE !((var_1_27 >> (var_1_34 + var_1_35)) <= var_1_9) [L135] var_1_33 = var_1_20 VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=251, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=7/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L193] RET step() [L194] CALL, EXPR property() [L184-L185] return (((((((var_1_1 == ((unsigned char) (var_1_2 || (! var_1_3)))) && ((var_1_12 == var_1_12) ? (var_1_4 == ((signed char) ((8 + ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8)))) - var_1_9))) : 1)) && (var_1_10 == ((unsigned long int) (4027026809u - (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) - var_1_7))))) && ((last_1_var_1_16 != last_1_var_1_10) ? ((var_1_8 <= last_1_var_1_16) ? (((- last_1_var_1_19) >= last_1_var_1_19) ? (var_1_12 == ((signed short int) var_1_8)) : 1) : 1) : (var_1_12 == ((signed short int) var_1_9)))) && (var_1_1 ? ((var_1_19 >= var_1_19) ? ((! var_1_3) ? (var_1_15 == ((signed short int) var_1_8)) : 1) : (var_1_15 == ((signed short int) var_1_7))) : (var_1_15 == ((signed short int) 5)))) && ((var_1_19 != var_1_19) ? (var_1_16 == ((unsigned long int) (((((var_1_11) < (var_1_7)) ? (var_1_11) : (var_1_7))) + var_1_8))) : ((var_1_4 > var_1_12) ? (var_1_16 == ((unsigned long int) (var_1_17 - (var_1_11 - var_1_8)))) : (var_1_16 == ((unsigned long int) (((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) - var_1_9)))))) && (var_1_19 == ((double) ((((((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) < (1.4)) ? (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) : (1.4)))))) && (((var_1_16 == (var_1_8 - var_1_9)) && var_1_1) ? (var_1_21 == ((unsigned short int) var_1_9)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=251, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=7/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=251, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=7/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=128, last_1_var_1_16=1, last_1_var_1_19=19/5, var_1_10=2953284989, var_1_11=1073741823, var_1_12=8, var_1_15=3, var_1_16=5, var_1_17=-2, var_1_18=-2, var_1_19=7/5, var_1_1=1, var_1_20=7/5, var_1_21=0, var_1_22=25, var_1_23=8, var_1_25=251, var_1_27=254, var_1_2=1, var_1_30=313/10, var_1_33=7/5, var_1_34=0, var_1_35=0, var_1_36=254, var_1_3=0, var_1_4=4, var_1_7=3, var_1_8=2, var_1_9=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 44.6s, OverallIterations: 13, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 22.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7107 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7040 mSDsluCounter, 5125 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3813 mSDsCounter, 1913 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4284 IncrementalHoareTripleChecker+Invalid, 6197 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1913 mSolverCounterUnsat, 1312 mSDtfsCounter, 4284 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2547 GetRequests, 2198 SyntacticMatches, 1 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21868 ImplicationChecksByTransitivity, 17.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=369occurred in iteration=12, InterpolantAutomatonStates: 294, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 1769 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 2900 NumberOfCodeBlocks, 2900 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 3526 ConstructedInterpolants, 0 QuantifiedInterpolants, 16999 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1962 ConjunctsInSsa, 96 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 22854/24288 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 06:16:42,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_fillercode_fillercodestructure_filler-pr-ci_file-11.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 b879c59582ac4a49c0e2ecf86f8757548b6309c2a4170b8da4007bca733fddea --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:16:45,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:16:45,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:16:45,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:16:45,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:16:45,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:16:45,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:16:45,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:16:45,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:16:45,202 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:16:45,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:16:45,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:16:45,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:16:45,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:16:45,203 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:16:45,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:16:45,203 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:16:45,203 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:16:45,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:16:45,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:16:45,204 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:16:45,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:45,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:16:45,205 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:16:45,206 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:16:45,206 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:16:45,206 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:16:45,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:16:45,206 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 -> b879c59582ac4a49c0e2ecf86f8757548b6309c2a4170b8da4007bca733fddea [2024-11-07 06:16:45,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:16:45,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:16:45,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:16:45,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:16:45,504 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:16:45,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2024-11-07 06:16:47,258 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:16:47,651 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:16:47,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2024-11-07 06:16:47,673 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba75f9e8e/9c02119c033a4759b29270028ca076c0/FLAG15ff9be67 [2024-11-07 06:16:47,709 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ba75f9e8e/9c02119c033a4759b29270028ca076c0 [2024-11-07 06:16:47,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:16:47,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:16:47,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:47,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:16:47,731 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:16:47,732 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:47" (1/1) ... [2024-11-07 06:16:47,733 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e171133 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:47, skipping insertion in model container [2024-11-07 06:16:47,733 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:16:47" (1/1) ... [2024-11-07 06:16:47,773 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:16:47,980 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_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2024-11-07 06:16:48,031 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:48,044 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:16:48,053 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_fillercode_fillercodestructure_filler-pr-ci_file-11.i[919,932] [2024-11-07 06:16:48,077 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:16:48,096 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:16:48,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48 WrapperNode [2024-11-07 06:16:48,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:16:48,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:48,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:16:48,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:16:48,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,136 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 180 [2024-11-07 06:16:48,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:16:48,138 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:16:48,138 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:16:48,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:16:48,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,153 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,167 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 06:16:48,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,176 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,180 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,185 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,186 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:16:48,197 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:16:48,197 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:16:48,197 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:16:48,198 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (1/1) ... [2024-11-07 06:16:48,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:16:48,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:16:48,268 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 06:16:48,279 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 06:16:48,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:16:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:16:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:16:48,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:16:48,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:16:48,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:16:48,453 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:16:48,459 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:16:51,709 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 06:16:51,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:16:51,718 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:16:51,718 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:16:51,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:51 BoogieIcfgContainer [2024-11-07 06:16:51,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:16:51,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:16:51,721 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:16:51,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:16:51,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:16:47" (1/3) ... [2024-11-07 06:16:51,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa17d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:51, skipping insertion in model container [2024-11-07 06:16:51,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:16:48" (2/3) ... [2024-11-07 06:16:51,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fa17d87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:16:51, skipping insertion in model container [2024-11-07 06:16:51,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:16:51" (3/3) ... [2024-11-07 06:16:51,729 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-11.i [2024-11-07 06:16:51,742 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:16:51,742 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:16:51,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:16:51,797 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;@715129d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:16:51,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:16:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:16:51,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2024-11-07 06:16:51,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:51,813 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:51,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:51,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:51,817 INFO L85 PathProgramCache]: Analyzing trace with hash 183038408, now seen corresponding path program 1 times [2024-11-07 06:16:51,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:51,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1612619048] [2024-11-07 06:16:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:51,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:51,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:51,832 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:51,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 06:16:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:16:52,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:52,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-07 06:16:52,184 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:52,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:52,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1612619048] [2024-11-07 06:16:52,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1612619048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:52,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:52,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:16:52,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753341581] [2024-11-07 06:16:52,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:52,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:16:52,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:52,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:16:52,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:52,217 INFO L87 Difference]: Start difference. First operand has 80 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:16:52,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:52,248 INFO L93 Difference]: Finished difference Result 153 states and 274 transitions. [2024-11-07 06:16:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:16:52,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2024-11-07 06:16:52,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:52,259 INFO L225 Difference]: With dead ends: 153 [2024-11-07 06:16:52,259 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 06:16:52,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:16:52,269 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:52,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:16:52,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 06:16:52,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-07 06:16:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 06:16:52,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 119 transitions. [2024-11-07 06:16:52,344 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 119 transitions. Word has length 154 [2024-11-07 06:16:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:52,344 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 119 transitions. [2024-11-07 06:16:52,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 06:16:52,345 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 119 transitions. [2024-11-07 06:16:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 06:16:52,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:52,347 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:52,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:16:52,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:52,549 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:52,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:52,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1096061112, now seen corresponding path program 1 times [2024-11-07 06:16:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:52,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723979077] [2024-11-07 06:16:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:52,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:52,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:52,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:52,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 06:16:52,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:52,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 06:16:52,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:54,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:16:54,024 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:54,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:54,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723979077] [2024-11-07 06:16:54,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723979077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:54,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:54,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:16:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978758536] [2024-11-07 06:16:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:54,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:16:54,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:54,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:16:54,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:16:54,026 INFO L87 Difference]: Start difference. First operand 76 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:54,570 INFO L93 Difference]: Finished difference Result 223 states and 352 transitions. [2024-11-07 06:16:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:16:54,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-07 06:16:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:54,575 INFO L225 Difference]: With dead ends: 223 [2024-11-07 06:16:54,575 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 06:16:54,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:16:54,577 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 84 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:54,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 396 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:16:54,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 06:16:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2024-11-07 06:16:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:16:54,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2024-11-07 06:16:54,605 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 155 [2024-11-07 06:16:54,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:54,606 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2024-11-07 06:16:54,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:16:54,606 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2024-11-07 06:16:54,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:16:54,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:54,608 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:54,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:16:54,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:54,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:54,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:54,810 INFO L85 PathProgramCache]: Analyzing trace with hash 875430585, now seen corresponding path program 1 times [2024-11-07 06:16:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123561719] [2024-11-07 06:16:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:54,810 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:54,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:54,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:54,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:16:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:55,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:16:55,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-07 06:16:55,344 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:16:55,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123561719] [2024-11-07 06:16:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123561719] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:55,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:16:55,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-07 06:16:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366019589] [2024-11-07 06:16:55,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:55,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:16:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:55,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:16:55,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:16:55,595 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-07 06:16:55,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:55,965 INFO L93 Difference]: Finished difference Result 209 states and 316 transitions. [2024-11-07 06:16:55,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:16:55,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 156 [2024-11-07 06:16:55,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:55,970 INFO L225 Difference]: With dead ends: 209 [2024-11-07 06:16:55,970 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 06:16:55,971 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 06:16:55,971 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 53 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:55,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 212 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:16:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 06:16:56,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-07 06:16:56,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 75 states have internal predecessors, (94), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:16:56,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2024-11-07 06:16:56,005 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 156 [2024-11-07 06:16:56,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:56,006 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2024-11-07 06:16:56,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-07 06:16:56,006 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2024-11-07 06:16:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-07 06:16:56,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:56,008 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:56,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:16:56,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:56,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:56,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash -135686665, now seen corresponding path program 1 times [2024-11-07 06:16:56,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:56,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368606229] [2024-11-07 06:16:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:56,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:56,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:56,224 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:56,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:16:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:56,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:16:56,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:56,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 269 proven. 60 refuted. 0 times theorem prover too weak. 775 trivial. 0 not checked. [2024-11-07 06:16:56,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:16:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 9 proven. 60 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-07 06:16:56,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368606229] [2024-11-07 06:16:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368606229] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:16:56,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:16:56,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-07 06:16:56,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039650826] [2024-11-07 06:16:56,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:16:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 06:16:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 06:16:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 06:16:56,981 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-07 06:16:57,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:16:57,387 INFO L93 Difference]: Finished difference Result 213 states and 315 transitions. [2024-11-07 06:16:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:16:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 156 [2024-11-07 06:16:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:16:57,393 INFO L225 Difference]: With dead ends: 213 [2024-11-07 06:16:57,393 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 06:16:57,394 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-07 06:16:57,394 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 212 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:16:57,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 196 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:16:57,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 06:16:57,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2024-11-07 06:16:57,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 75 states have internal predecessors, (92), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:16:57,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 188 transitions. [2024-11-07 06:16:57,427 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 188 transitions. Word has length 156 [2024-11-07 06:16:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:16:57,428 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 188 transitions. [2024-11-07 06:16:57,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2024-11-07 06:16:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 188 transitions. [2024-11-07 06:16:57,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 06:16:57,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:16:57,434 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:16:57,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 06:16:57,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:57,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:16:57,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:16:57,637 INFO L85 PathProgramCache]: Analyzing trace with hash 223061652, now seen corresponding path program 1 times [2024-11-07 06:16:57,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:16:57,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830030617] [2024-11-07 06:16:57,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:16:57,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:16:57,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:16:57,641 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:16:57,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:16:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:16:57,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 06:16:57,835 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:16:58,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 06:16:58,244 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:16:58,244 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:16:58,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830030617] [2024-11-07 06:16:58,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830030617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:16:58,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:16:58,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:16:58,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139817529] [2024-11-07 06:16:58,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:16:58,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:16:58,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:16:58,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:16:58,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:16:58,246 INFO L87 Difference]: Start difference. First operand 128 states and 188 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:17:01,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:17:01,175 INFO L93 Difference]: Finished difference Result 213 states and 316 transitions. [2024-11-07 06:17:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:17:01,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-07 06:17:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:17:01,179 INFO L225 Difference]: With dead ends: 213 [2024-11-07 06:17:01,181 INFO L226 Difference]: Without dead ends: 136 [2024-11-07 06:17:01,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:17:01,182 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 98 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-07 06:17:01,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 244 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-07 06:17:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-07 06:17:01,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-11-07 06:17:01,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 06:17:01,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 195 transitions. [2024-11-07 06:17:01,220 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 195 transitions. Word has length 157 [2024-11-07 06:17:01,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:17:01,221 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 195 transitions. [2024-11-07 06:17:01,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 06:17:01,221 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 195 transitions. [2024-11-07 06:17:01,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 06:17:01,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:17:01,223 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:17:01,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-07 06:17:01,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:01,429 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:17:01,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:17:01,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1296962025, now seen corresponding path program 1 times [2024-11-07 06:17:01,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:17:01,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212231770] [2024-11-07 06:17:01,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:17:01,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:17:01,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:17:01,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:17:01,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-07 06:17:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:17:01,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 06:17:01,616 INFO L278 TraceCheckSpWp]: Computing forward predicates...