./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.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-76.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', '315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3'] 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-76.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 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:23:42,946 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:23:43,026 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:23:43,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:23:43,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:23:43,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:23:43,054 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:23:43,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:23:43,055 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:23:43,056 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:23:43,057 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:23:43,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:23:43,057 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:23:43,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:23:43,058 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:23:43,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:23:43,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:23:43,058 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:23:43,058 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:23:43,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:23:43,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:23:43,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:23:43,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:23:43,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:23:43,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:23:43,059 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:23:43,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:23:43,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:23:43,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:23:43,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:23:43,060 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:23:43,060 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:23:43,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:23:43,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:23:43,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:23:43,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:23:43,061 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:23:43,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:23:43,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:23:43,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:23:43,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:23:43,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:23:43,062 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 -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-11-07 06:23:43,338 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:23:43,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:23:43,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:23:43,354 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:23:43,355 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:23:43,356 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-76.i [2024-11-07 06:23:44,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:23:44,986 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:23:44,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-07 06:23:44,995 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47c6d1cf2/d0b49fd9b5b34d6da31c9582218a4344/FLAG8ca3c8cf6 [2024-11-07 06:23:45,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/47c6d1cf2/d0b49fd9b5b34d6da31c9582218a4344 [2024-11-07 06:23:45,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:23:45,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:23:45,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:23:45,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:23:45,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:23:45,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@420386ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45, skipping insertion in model container [2024-11-07 06:23:45,034 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:23:45,174 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-76.i[919,932] [2024-11-07 06:23:45,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:23:45,259 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:23:45,269 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-76.i[919,932] [2024-11-07 06:23:45,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:23:45,327 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:23:45,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45 WrapperNode [2024-11-07 06:23:45,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:23:45,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:23:45,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:23:45,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:23:45,336 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:23:45" (1/1) ... [2024-11-07 06:23:45,351 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:23:45" (1/1) ... [2024-11-07 06:23:45,397 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-07 06:23:45,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:23:45,401 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:23:45,402 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:23:45,402 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:23:45,412 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,413 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,420 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,457 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:23:45,458 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,458 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,480 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,487 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,489 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:23:45,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:23:45,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:23:45,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:23:45,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (1/1) ... [2024-11-07 06:23:45,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:23:45,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:23:45,536 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:23:45,543 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:23:45,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:23:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:23:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:23:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:23:45,564 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:23:45,564 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:23:45,665 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:23:45,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:23:46,149 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 06:23:46,150 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:23:46,161 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:23:46,163 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:23:46,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:23:46 BoogieIcfgContainer [2024-11-07 06:23:46,164 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:23:46,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:23:46,167 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:23:46,172 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:23:46,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:23:45" (1/3) ... [2024-11-07 06:23:46,173 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272aa182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:23:46, skipping insertion in model container [2024-11-07 06:23:46,173 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:23:45" (2/3) ... [2024-11-07 06:23:46,174 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272aa182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:23:46, skipping insertion in model container [2024-11-07 06:23:46,174 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:23:46" (3/3) ... [2024-11-07 06:23:46,176 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-07 06:23:46,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:23:46,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:23:46,258 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:23:46,269 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;@64716bee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:23:46,269 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:23:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 06:23:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:23:46,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:46,289 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:46,290 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:46,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1854159536, now seen corresponding path program 1 times [2024-11-07 06:23:46,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:46,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673692975] [2024-11-07 06:23:46,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:46,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:46,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:46,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:46,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:46,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:46,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:46,680 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:46,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:46,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673692975] [2024-11-07 06:23:46,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673692975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:46,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:23:46,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732869100] [2024-11-07 06:23:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:46,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:23:46,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:46,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:23:46,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:23:46,712 INFO L87 Difference]: Start difference. First operand has 90 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 69 states have internal predecessors, (104), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 06:23:46,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:46,743 INFO L93 Difference]: Finished difference Result 168 states and 289 transitions. [2024-11-07 06:23:46,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:23:46,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-07 06:23:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:46,750 INFO L225 Difference]: With dead ends: 168 [2024-11-07 06:23:46,750 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 06:23:46,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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:23:46,756 INFO L432 NwaCegarLoop]: 124 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, 124 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:23:46,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:23:46,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 06:23:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 06:23:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4333333333333333) internal successors, (86), 60 states have internal predecessors, (86), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 06:23:46,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-07 06:23:46,802 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 137 [2024-11-07 06:23:46,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:46,802 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-07 06:23:46,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-07 06:23:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-07 06:23:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:23:46,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:46,810 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:46,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:23:46,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1080617290, now seen corresponding path program 1 times [2024-11-07 06:23:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167128978] [2024-11-07 06:23:46,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:46,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:47,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:47,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:47,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:47,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:47,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:47,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167128978] [2024-11-07 06:23:47,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167128978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:47,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:47,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:23:47,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125996699] [2024-11-07 06:23:47,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:47,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:23:47,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:47,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:23:47,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:23:47,523 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:48,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:48,067 INFO L93 Difference]: Finished difference Result 342 states and 518 transitions. [2024-11-07 06:23:48,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 06:23:48,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-07 06:23:48,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:48,071 INFO L225 Difference]: With dead ends: 342 [2024-11-07 06:23:48,071 INFO L226 Difference]: Without dead ends: 264 [2024-11-07 06:23:48,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:23:48,073 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 299 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:48,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 341 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:23:48,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-07 06:23:48,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 255. [2024-11-07 06:23:48,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 190 states have (on average 1.4157894736842105) internal successors, (269), 192 states have internal predecessors, (269), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:23:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 389 transitions. [2024-11-07 06:23:48,127 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 389 transitions. Word has length 137 [2024-11-07 06:23:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:48,127 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 389 transitions. [2024-11-07 06:23:48,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 389 transitions. [2024-11-07 06:23:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:23:48,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:48,130 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:48,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:23:48,130 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:48,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:48,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1626002104, now seen corresponding path program 1 times [2024-11-07 06:23:48,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:48,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830465637] [2024-11-07 06:23:48,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:48,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:48,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:48,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:48,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:48,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:48,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:48,574 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:48,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:48,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830465637] [2024-11-07 06:23:48,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830465637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:48,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:48,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:23:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502401707] [2024-11-07 06:23:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:48,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:23:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:23:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:23:48,581 INFO L87 Difference]: Start difference. First operand 255 states and 389 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:48,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:48,980 INFO L93 Difference]: Finished difference Result 883 states and 1350 transitions. [2024-11-07 06:23:48,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:23:48,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-07 06:23:48,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:48,987 INFO L225 Difference]: With dead ends: 883 [2024-11-07 06:23:48,988 INFO L226 Difference]: Without dead ends: 631 [2024-11-07 06:23:48,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:23:48,990 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 266 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:48,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 302 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:23:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-07 06:23:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 627. [2024-11-07 06:23:49,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 627 states, 466 states have (on average 1.4141630901287554) internal successors, (659), 471 states have internal predecessors, (659), 150 states have call successors, (150), 10 states have call predecessors, (150), 10 states have return successors, (150), 145 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-07 06:23:49,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 959 transitions. [2024-11-07 06:23:49,101 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 959 transitions. Word has length 137 [2024-11-07 06:23:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:49,106 INFO L471 AbstractCegarLoop]: Abstraction has 627 states and 959 transitions. [2024-11-07 06:23:49,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 959 transitions. [2024-11-07 06:23:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:23:49,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:49,108 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:49,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:23:49,111 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:49,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash 2048703930, now seen corresponding path program 1 times [2024-11-07 06:23:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:49,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986818674] [2024-11-07 06:23:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:49,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:49,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:49,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:49,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:49,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:49,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:49,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:49,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:49,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:49,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986818674] [2024-11-07 06:23:49,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986818674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:49,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:49,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:23:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453458889] [2024-11-07 06:23:49,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:49,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:23:49,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:49,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:23:49,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:23:49,371 INFO L87 Difference]: Start difference. First operand 627 states and 959 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:49,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:49,897 INFO L93 Difference]: Finished difference Result 1448 states and 2212 transitions. [2024-11-07 06:23:49,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:23:49,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-07 06:23:49,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:49,910 INFO L225 Difference]: With dead ends: 1448 [2024-11-07 06:23:49,910 INFO L226 Difference]: Without dead ends: 822 [2024-11-07 06:23:49,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:23:49,916 INFO L432 NwaCegarLoop]: 302 mSDtfsCounter, 215 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:49,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 723 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:23:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2024-11-07 06:23:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 818. [2024-11-07 06:23:50,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 604 states have (on average 1.3973509933774835) internal successors, (844), 610 states have internal predecessors, (844), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-07 06:23:50,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1242 transitions. [2024-11-07 06:23:50,043 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1242 transitions. Word has length 137 [2024-11-07 06:23:50,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:50,043 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1242 transitions. [2024-11-07 06:23:50,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:50,044 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1242 transitions. [2024-11-07 06:23:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:23:50,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:50,047 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:50,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:23:50,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:50,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:50,048 INFO L85 PathProgramCache]: Analyzing trace with hash -517366854, now seen corresponding path program 1 times [2024-11-07 06:23:50,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019863517] [2024-11-07 06:23:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:50,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:50,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:50,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:50,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:50,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:50,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:50,409 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:50,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:50,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019863517] [2024-11-07 06:23:50,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019863517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:50,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:50,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:23:50,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470242314] [2024-11-07 06:23:50,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:50,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:23:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:50,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:23:50,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:23:50,415 INFO L87 Difference]: Start difference. First operand 818 states and 1242 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:50,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:50,738 INFO L93 Difference]: Finished difference Result 1564 states and 2365 transitions. [2024-11-07 06:23:50,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:23:50,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-07 06:23:50,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:50,747 INFO L225 Difference]: With dead ends: 1564 [2024-11-07 06:23:50,749 INFO L226 Difference]: Without dead ends: 880 [2024-11-07 06:23:50,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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:23:50,755 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 249 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:50,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 226 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:23:50,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2024-11-07 06:23:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 697. [2024-11-07 06:23:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 515 states have (on average 1.396116504854369) internal successors, (719), 520 states have internal predecessors, (719), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-07 06:23:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1057 transitions. [2024-11-07 06:23:50,833 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1057 transitions. Word has length 137 [2024-11-07 06:23:50,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:50,835 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1057 transitions. [2024-11-07 06:23:50,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:50,835 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1057 transitions. [2024-11-07 06:23:50,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:23:50,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:50,838 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:50,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:23:50,838 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:50,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:50,839 INFO L85 PathProgramCache]: Analyzing trace with hash -2105714756, now seen corresponding path program 1 times [2024-11-07 06:23:50,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:50,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776005864] [2024-11-07 06:23:50,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:50,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:51,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:51,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:51,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:51,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:51,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776005864] [2024-11-07 06:23:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776005864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:51,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:23:51,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140479112] [2024-11-07 06:23:51,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:23:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:23:51,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:23:51,395 INFO L87 Difference]: Start difference. First operand 697 states and 1057 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:51,812 INFO L93 Difference]: Finished difference Result 1515 states and 2294 transitions. [2024-11-07 06:23:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:23:51,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-07 06:23:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:51,820 INFO L225 Difference]: With dead ends: 1515 [2024-11-07 06:23:51,820 INFO L226 Difference]: Without dead ends: 821 [2024-11-07 06:23:51,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 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:23:51,823 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 346 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:51,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 418 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:23:51,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-07 06:23:51,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 697. [2024-11-07 06:23:51,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 515 states have (on average 1.3941747572815535) internal successors, (718), 520 states have internal predecessors, (718), 169 states have call successors, (169), 12 states have call predecessors, (169), 12 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2024-11-07 06:23:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1056 transitions. [2024-11-07 06:23:51,899 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1056 transitions. Word has length 137 [2024-11-07 06:23:51,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:51,899 INFO L471 AbstractCegarLoop]: Abstraction has 697 states and 1056 transitions. [2024-11-07 06:23:51,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:51,900 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1056 transitions. [2024-11-07 06:23:51,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 06:23:51,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:51,903 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:51,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:23:51,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:51,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash -288892625, now seen corresponding path program 1 times [2024-11-07 06:23:51,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:51,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206724455] [2024-11-07 06:23:51,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:52,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:52,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:52,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:52,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206724455] [2024-11-07 06:23:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206724455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:52,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:52,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:23:52,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122179344] [2024-11-07 06:23:52,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:52,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:23:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:52,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:23:52,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:23:52,134 INFO L87 Difference]: Start difference. First operand 697 states and 1056 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:52,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:52,520 INFO L93 Difference]: Finished difference Result 1541 states and 2332 transitions. [2024-11-07 06:23:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:23:52,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 06:23:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:52,530 INFO L225 Difference]: With dead ends: 1541 [2024-11-07 06:23:52,531 INFO L226 Difference]: Without dead ends: 847 [2024-11-07 06:23:52,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:23:52,534 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 293 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:52,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 316 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 06:23:52,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-07 06:23:52,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 834. [2024-11-07 06:23:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 834 states, 610 states have (on average 1.383606557377049) internal successors, (844), 616 states have internal predecessors, (844), 207 states have call successors, (207), 16 states have call predecessors, (207), 16 states have return successors, (207), 201 states have call predecessors, (207), 207 states have call successors, (207) [2024-11-07 06:23:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 1258 transitions. [2024-11-07 06:23:52,640 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 1258 transitions. Word has length 138 [2024-11-07 06:23:52,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:52,640 INFO L471 AbstractCegarLoop]: Abstraction has 834 states and 1258 transitions. [2024-11-07 06:23:52,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1258 transitions. [2024-11-07 06:23:52,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 06:23:52,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:52,645 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:52,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:23:52,645 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:52,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:52,645 INFO L85 PathProgramCache]: Analyzing trace with hash -226853011, now seen corresponding path program 1 times [2024-11-07 06:23:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:52,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011774093] [2024-11-07 06:23:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:52,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:52,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:52,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:52,740 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:52,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:52,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011774093] [2024-11-07 06:23:52,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011774093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:52,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:52,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:23:52,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221980734] [2024-11-07 06:23:52,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:52,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:23:52,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:23:52,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:23:52,742 INFO L87 Difference]: Start difference. First operand 834 states and 1258 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:52,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:52,890 INFO L93 Difference]: Finished difference Result 1496 states and 2256 transitions. [2024-11-07 06:23:52,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:23:52,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-07 06:23:52,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:52,898 INFO L225 Difference]: With dead ends: 1496 [2024-11-07 06:23:52,898 INFO L226 Difference]: Without dead ends: 786 [2024-11-07 06:23:52,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:23:52,901 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 114 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:52,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 245 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:23:52,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2024-11-07 06:23:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2024-11-07 06:23:52,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 570 states have (on average 1.368421052631579) internal successors, (780), 576 states have internal predecessors, (780), 199 states have call successors, (199), 14 states have call predecessors, (199), 14 states have return successors, (199), 193 states have call predecessors, (199), 199 states have call successors, (199) [2024-11-07 06:23:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1178 transitions. [2024-11-07 06:23:53,007 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1178 transitions. Word has length 138 [2024-11-07 06:23:53,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:53,007 INFO L471 AbstractCegarLoop]: Abstraction has 784 states and 1178 transitions. [2024-11-07 06:23:53,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1178 transitions. [2024-11-07 06:23:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 06:23:53,011 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:53,011 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:53,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 06:23:53,011 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:53,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:53,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1010175940, now seen corresponding path program 1 times [2024-11-07 06:23:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:53,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854387946] [2024-11-07 06:23:53,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:53,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:53,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:23:53,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [26553921] [2024-11-07 06:23:53,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:53,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:23:53,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:23:53,095 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:23:53,097 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:23:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:53,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 06:23:53,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:23:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:54,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:23:54,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:54,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854387946] [2024-11-07 06:23:54,137 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:23:54,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26553921] [2024-11-07 06:23:54,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26553921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:54,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:54,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:23:54,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180267014] [2024-11-07 06:23:54,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:54,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:23:54,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:54,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:23:54,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:23:54,140 INFO L87 Difference]: Start difference. First operand 784 states and 1178 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:55,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:55,273 INFO L93 Difference]: Finished difference Result 2770 states and 4159 transitions. [2024-11-07 06:23:55,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:23:55,274 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-07 06:23:55,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:55,291 INFO L225 Difference]: With dead ends: 2770 [2024-11-07 06:23:55,292 INFO L226 Difference]: Without dead ends: 2110 [2024-11-07 06:23:55,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:23:55,296 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 428 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:55,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 725 Invalid, 870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:23:55,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2110 states. [2024-11-07 06:23:55,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2110 to 1568. [2024-11-07 06:23:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1141 states have (on average 1.3567046450482034) internal successors, (1548), 1153 states have internal predecessors, (1548), 398 states have call successors, (398), 28 states have call predecessors, (398), 28 states have return successors, (398), 386 states have call predecessors, (398), 398 states have call successors, (398) [2024-11-07 06:23:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2344 transitions. [2024-11-07 06:23:55,488 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2344 transitions. Word has length 139 [2024-11-07 06:23:55,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:55,489 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2344 transitions. [2024-11-07 06:23:55,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:55,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2344 transitions. [2024-11-07 06:23:55,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 06:23:55,491 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:55,491 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 06:23:55,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:23:55,693 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:55,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:55,693 INFO L85 PathProgramCache]: Analyzing trace with hash -309111362, now seen corresponding path program 1 times [2024-11-07 06:23:55,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:55,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635974395] [2024-11-07 06:23:55,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:55,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:23:55,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044115431] [2024-11-07 06:23:55,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:55,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:23:55,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:23:55,752 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:23:55,754 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:23:55,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:55,913 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 06:23:55,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:23:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:56,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:23:56,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:56,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635974395] [2024-11-07 06:23:56,177 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:23:56,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044115431] [2024-11-07 06:23:56,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044115431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:56,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:56,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:23:56,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502345389] [2024-11-07 06:23:56,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:56,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:23:56,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:56,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:23:56,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:23:56,179 INFO L87 Difference]: Start difference. First operand 1568 states and 2344 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:57,099 INFO L93 Difference]: Finished difference Result 6033 states and 9069 transitions. [2024-11-07 06:23:57,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:23:57,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-07 06:23:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:57,129 INFO L225 Difference]: With dead ends: 6033 [2024-11-07 06:23:57,130 INFO L226 Difference]: Without dead ends: 4468 [2024-11-07 06:23:57,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-07 06:23:57,140 INFO L432 NwaCegarLoop]: 381 mSDtfsCounter, 361 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:57,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1154 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:23:57,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4468 states. [2024-11-07 06:23:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4468 to 3528. [2024-11-07 06:23:57,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 2526 states have (on average 1.3365003958828188) internal successors, (3376), 2554 states have internal predecessors, (3376), 935 states have call successors, (935), 66 states have call predecessors, (935), 66 states have return successors, (935), 907 states have call predecessors, (935), 935 states have call successors, (935) [2024-11-07 06:23:57,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 5246 transitions. [2024-11-07 06:23:57,623 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 5246 transitions. Word has length 139 [2024-11-07 06:23:57,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:57,623 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 5246 transitions. [2024-11-07 06:23:57,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:57,624 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5246 transitions. [2024-11-07 06:23:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 06:23:57,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:57,627 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:57,647 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:23:57,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:23:57,828 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:57,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:57,829 INFO L85 PathProgramCache]: Analyzing trace with hash -794234149, now seen corresponding path program 1 times [2024-11-07 06:23:57,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:57,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484144795] [2024-11-07 06:23:57,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:57,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:58,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:58,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:58,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:58,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:58,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484144795] [2024-11-07 06:23:58,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484144795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:58,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:58,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:23:58,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995255115] [2024-11-07 06:23:58,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:58,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:23:58,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:58,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:23:58,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:23:58,122 INFO L87 Difference]: Start difference. First operand 3528 states and 5246 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:23:58,585 INFO L93 Difference]: Finished difference Result 6894 states and 10284 transitions. [2024-11-07 06:23:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:23:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-07 06:23:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:23:58,616 INFO L225 Difference]: With dead ends: 6894 [2024-11-07 06:23:58,617 INFO L226 Difference]: Without dead ends: 4156 [2024-11-07 06:23:58,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:23:58,663 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:23:58,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 254 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:23:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4156 states. [2024-11-07 06:23:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4156 to 4113. [2024-11-07 06:23:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4113 states, 2951 states have (on average 1.3381904439173162) internal successors, (3949), 2984 states have internal predecessors, (3949), 1085 states have call successors, (1085), 76 states have call predecessors, (1085), 76 states have return successors, (1085), 1052 states have call predecessors, (1085), 1085 states have call successors, (1085) [2024-11-07 06:23:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4113 states to 4113 states and 6119 transitions. [2024-11-07 06:23:59,067 INFO L78 Accepts]: Start accepts. Automaton has 4113 states and 6119 transitions. Word has length 139 [2024-11-07 06:23:59,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:23:59,068 INFO L471 AbstractCegarLoop]: Abstraction has 4113 states and 6119 transitions. [2024-11-07 06:23:59,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:23:59,068 INFO L276 IsEmpty]: Start isEmpty. Operand 4113 states and 6119 transitions. [2024-11-07 06:23:59,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 06:23:59,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:23:59,071 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:59,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 06:23:59,072 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:23:59,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:23:59,073 INFO L85 PathProgramCache]: Analyzing trace with hash -371532323, now seen corresponding path program 1 times [2024-11-07 06:23:59,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:23:59,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559941142] [2024-11-07 06:23:59,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:23:59,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:23:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:23:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:23:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:23:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:23:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:23:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:23:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:23:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:23:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:23:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:23:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:23:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:23:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:23:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:23:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:23:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:23:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:23:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:23:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:23:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:23:59,808 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:23:59,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:23:59,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559941142] [2024-11-07 06:23:59,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559941142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:23:59,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:23:59,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:23:59,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073337607] [2024-11-07 06:23:59,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:23:59,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:23:59,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:23:59,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:23:59,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:23:59,812 INFO L87 Difference]: Start difference. First operand 4113 states and 6119 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:00,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:00,593 INFO L93 Difference]: Finished difference Result 5550 states and 8261 transitions. [2024-11-07 06:24:00,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:24:00,593 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 139 [2024-11-07 06:24:00,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:00,622 INFO L225 Difference]: With dead ends: 5550 [2024-11-07 06:24:00,622 INFO L226 Difference]: Without dead ends: 3633 [2024-11-07 06:24:00,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:24:00,634 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 330 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:00,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 486 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 06:24:00,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2024-11-07 06:24:00,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 3625. [2024-11-07 06:24:00,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3625 states, 2591 states have (on average 1.3342338865302972) internal successors, (3457), 2620 states have internal predecessors, (3457), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-07 06:24:01,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3625 states to 3625 states and 5387 transitions. [2024-11-07 06:24:01,018 INFO L78 Accepts]: Start accepts. Automaton has 3625 states and 5387 transitions. Word has length 139 [2024-11-07 06:24:01,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:01,018 INFO L471 AbstractCegarLoop]: Abstraction has 3625 states and 5387 transitions. [2024-11-07 06:24:01,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:01,019 INFO L276 IsEmpty]: Start isEmpty. Operand 3625 states and 5387 transitions. [2024-11-07 06:24:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:24:01,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:01,021 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:01,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 06:24:01,021 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:01,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:01,022 INFO L85 PathProgramCache]: Analyzing trace with hash -822195952, now seen corresponding path program 1 times [2024-11-07 06:24:01,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:01,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724413739] [2024-11-07 06:24:01,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:01,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:01,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:24:01,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1208170803] [2024-11-07 06:24:01,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:01,071 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:24:01,079 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:24:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:01,198 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-07 06:24:01,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:24:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:24:01,663 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:24:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:24:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724413739] [2024-11-07 06:24:01,664 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 06:24:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208170803] [2024-11-07 06:24:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208170803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:24:01,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:24:01,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 06:24:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725951639] [2024-11-07 06:24:01,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:24:01,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:24:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:24:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:24:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:24:01,666 INFO L87 Difference]: Start difference. First operand 3625 states and 5387 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:02,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:02,615 INFO L93 Difference]: Finished difference Result 4555 states and 6767 transitions. [2024-11-07 06:24:02,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 06:24:02,616 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-07 06:24:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:02,648 INFO L225 Difference]: With dead ends: 4555 [2024-11-07 06:24:02,648 INFO L226 Difference]: Without dead ends: 3896 [2024-11-07 06:24:02,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2024-11-07 06:24:02,654 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 467 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:02,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1002 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 06:24:02,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2024-11-07 06:24:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3637. [2024-11-07 06:24:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3637 states, 2603 states have (on average 1.3357664233576643) internal successors, (3477), 2632 states have internal predecessors, (3477), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-07 06:24:02,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3637 states to 3637 states and 5407 transitions. [2024-11-07 06:24:02,952 INFO L78 Accepts]: Start accepts. Automaton has 3637 states and 5407 transitions. Word has length 140 [2024-11-07 06:24:02,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:02,953 INFO L471 AbstractCegarLoop]: Abstraction has 3637 states and 5407 transitions. [2024-11-07 06:24:02,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3637 states and 5407 transitions. [2024-11-07 06:24:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:24:02,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:02,956 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:02,975 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:24:03,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:03,157 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:03,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -747749173, now seen corresponding path program 1 times [2024-11-07 06:24:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:03,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585335815] [2024-11-07 06:24:03,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:03,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:24:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 06:24:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 06:24:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:24:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:24:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 06:24:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:24:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 06:24:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:24:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 06:24:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:24:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-07 06:24:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:24:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 06:24:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:24:03,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 06:24:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:24:03,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 06:24:03,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:24:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:03,242 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:24:03,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:24:03,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585335815] [2024-11-07 06:24:03,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585335815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:24:03,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:24:03,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:24:03,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934362641] [2024-11-07 06:24:03,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:24:03,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:24:03,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:24:03,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:24:03,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:24:03,245 INFO L87 Difference]: Start difference. First operand 3637 states and 5407 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:03,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:03,514 INFO L93 Difference]: Finished difference Result 8813 states and 13013 transitions. [2024-11-07 06:24:03,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:24:03,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-07 06:24:03,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:03,556 INFO L225 Difference]: With dead ends: 8813 [2024-11-07 06:24:03,556 INFO L226 Difference]: Without dead ends: 5179 [2024-11-07 06:24:03,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:24:03,571 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:03,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 229 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:24:03,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5179 states. [2024-11-07 06:24:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5179 to 4484. [2024-11-07 06:24:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4484 states, 3450 states have (on average 1.3620289855072463) internal successors, (4699), 3479 states have internal predecessors, (4699), 965 states have call successors, (965), 68 states have call predecessors, (965), 68 states have return successors, (965), 936 states have call predecessors, (965), 965 states have call successors, (965) [2024-11-07 06:24:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6629 transitions. [2024-11-07 06:24:03,894 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6629 transitions. Word has length 140 [2024-11-07 06:24:03,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:03,894 INFO L471 AbstractCegarLoop]: Abstraction has 4484 states and 6629 transitions. [2024-11-07 06:24:03,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:03,895 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6629 transitions. [2024-11-07 06:24:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:24:03,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:03,898 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:03,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 06:24:03,899 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:03,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:03,899 INFO L85 PathProgramCache]: Analyzing trace with hash -67690803, now seen corresponding path program 1 times [2024-11-07 06:24:03,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:24:03,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332286787] [2024-11-07 06:24:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:24:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:24:03,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642527380] [2024-11-07 06:24:03,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:03,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:24:03,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:03,985 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:24:03,987 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:24:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:24:04,140 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:24:04,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:24:04,312 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:24:04,312 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:24:04,313 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:24:04,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 06:24:04,520 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,SelfDestructingSolverStorable14 [2024-11-07 06:24:04,523 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:24:04,646 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:24:04,651 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:24:04 BoogieIcfgContainer [2024-11-07 06:24:04,652 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:24:04,652 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:24:04,653 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:24:04,653 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:24:04,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:23:46" (3/4) ... [2024-11-07 06:24:04,656 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:24:04,657 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:24:04,658 INFO L158 Benchmark]: Toolchain (without parser) took 19633.98ms. Allocated memory was 117.4MB in the beginning and 964.7MB in the end (delta: 847.2MB). Free memory was 91.8MB in the beginning and 851.5MB in the end (delta: -759.6MB). Peak memory consumption was 91.3MB. Max. memory is 16.1GB. [2024-11-07 06:24:04,658 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:24:04,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.88ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:24:04,658 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.90ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 72.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:24:04,659 INFO L158 Benchmark]: Boogie Preprocessor took 94.05ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 67.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:24:04,659 INFO L158 Benchmark]: RCFGBuilder took 667.32ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 86.8MB in the end (delta: -18.9MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2024-11-07 06:24:04,659 INFO L158 Benchmark]: TraceAbstraction took 18485.59ms. Allocated memory was 117.4MB in the beginning and 964.7MB in the end (delta: 847.2MB). Free memory was 86.4MB in the beginning and 851.6MB in the end (delta: -765.3MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2024-11-07 06:24:04,660 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 964.7MB. Free memory was 851.6MB in the beginning and 851.5MB in the end (delta: 172.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:24:04,661 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.79ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 302.88ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 76.3MB in the end (delta: 15.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.90ms. Allocated memory is still 117.4MB. Free memory was 76.3MB in the beginning and 72.4MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 94.05ms. Allocated memory is still 117.4MB. Free memory was 72.4MB in the beginning and 67.9MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 667.32ms. Allocated memory is still 117.4MB. Free memory was 67.9MB in the beginning and 86.8MB in the end (delta: -18.9MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * TraceAbstraction took 18485.59ms. Allocated memory was 117.4MB in the beginning and 964.7MB in the end (delta: 847.2MB). Free memory was 86.4MB in the beginning and 851.6MB in the end (delta: -765.3MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 964.7MB. Free memory was 851.6MB in the beginning and 851.5MB in the end (delta: 172.6kB). 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 someBinaryDOUBLEComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 180. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 256.5; [L23] unsigned char var_1_2 = 0; [L24] double var_1_3 = 7.5; [L25] double var_1_4 = 256.2; [L26] double var_1_5 = 2.75; [L27] signed long int var_1_6 = -64; [L28] double var_1_7 = 8.05; [L29] float var_1_8 = 5.25; [L30] signed long int var_1_11 = 4; [L31] unsigned short int var_1_14 = 10000; [L32] unsigned short int var_1_16 = 5; [L33] unsigned short int var_1_17 = 4; [L34] unsigned char var_1_18 = 100; [L35] unsigned char var_1_19 = 1; [L36] unsigned char var_1_20 = 8; [L37] double var_1_21 = 63.25; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_25 = 0; [L40] unsigned char var_1_26 = 0; [L41] signed long int var_1_27 = 0; [L42] signed short int var_1_29 = 2; [L43] unsigned char var_1_31 = 1; [L44] signed long int var_1_32 = 32; [L45] signed long int var_1_34 = 0; [L46] unsigned char var_1_37 = 1; [L47] unsigned long int var_1_38 = 16; [L48] unsigned char var_1_39 = 0; [L49] unsigned char var_1_40 = 0; [L50] double last_1_var_1_1 = 256.5; [L51] float last_1_var_1_8 = 5.25; [L52] signed long int last_1_var_1_11 = 4; [L53] unsigned short int last_1_var_1_14 = 10000; [L54] unsigned short int last_1_var_1_17 = 4; [L55] unsigned char last_1_var_1_18 = 100; VAL [isInitial=0, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L184] isInitial = 1 [L185] FCALL initially() [L186] COND TRUE 1 [L187] CALL updateLastVariables() [L172] last_1_var_1_1 = var_1_1 [L173] last_1_var_1_8 = var_1_8 [L174] last_1_var_1_11 = var_1_11 [L175] last_1_var_1_14 = var_1_14 [L176] last_1_var_1_17 = var_1_17 [L177] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L187] RET updateLastVariables() [L188] 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_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_3=15/2, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L143] var_1_3 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L144] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_4=1281/5, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L145] var_1_4 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L146] RET assume_abort_if_not((var_1_4 >= -922337.2036854765600e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_5=11/4, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L147] var_1_5 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L148] RET assume_abort_if_not((var_1_5 >= -922337.2036854765600e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_7=161/20, var_1_8=21/4] [L149] var_1_7 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L150] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] CALL assume_abort_if_not(var_1_7 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L151] RET assume_abort_if_not(var_1_7 != 0.0F) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=5, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L152] var_1_16 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L153] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] CALL assume_abort_if_not(var_1_16 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L154] RET assume_abort_if_not(var_1_16 <= 65534) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=1, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L155] var_1_19 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L156] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] CALL assume_abort_if_not(var_1_19 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L157] RET assume_abort_if_not(var_1_19 <= 64) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=8, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L159] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L161] var_1_25 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L162] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L163] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L164] var_1_26 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L165] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L166] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=0, var_1_6=-64, var_1_8=21/4] [L167] var_1_40 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_40 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L168] RET assume_abort_if_not(var_1_40 >= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] CALL assume_abort_if_not(var_1_40 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L169] RET assume_abort_if_not(var_1_40 <= 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=4, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L188] RET updateVariables() [L189] CALL step() [L59] COND FALSE !(\read(var_1_2)) [L68] var_1_17 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=1, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L70] COND TRUE var_1_17 == var_1_18 [L71] var_1_31 = (! var_1_26) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L73] COND TRUE var_1_16 < var_1_11 [L74] var_1_34 = var_1_16 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR var_1_18 & var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] EXPR (var_1_18 & var_1_17) & var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=16, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L84] COND TRUE ((((var_1_17) > (var_1_18)) ? (var_1_17) : (var_1_18))) <= ((var_1_18 & var_1_17) & var_1_18) [L85] var_1_38 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=513/2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_40=1, var_1_6=-64, var_1_8=21/4] [L87] COND TRUE ! var_1_2 [L88] var_1_1 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L92] COND FALSE !(var_1_5 > (var_1_3 / var_1_7)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=0, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L97] var_1_27 = var_1_17 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L98] COND TRUE var_1_20 < var_1_17 [L99] var_1_39 = (! (var_1_26 && var_1_40)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L101] unsigned short int stepLocal_1 = var_1_16; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] EXPR var_1_6 | var_1_6 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_1=0, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=2, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L102] COND FALSE !((var_1_6 + (var_1_6 | var_1_6)) > stepLocal_1) [L105] var_1_29 = var_1_18 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L106] COND FALSE !(var_1_5 >= var_1_1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=4, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L113] COND TRUE var_1_4 <= last_1_var_1_1 [L114] var_1_11 = (last_1_var_1_14 + -128) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=253/4, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=1, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L118] var_1_21 = var_1_5 [L119] var_1_37 = (var_1_2 && var_1_25) [L120] signed long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, stepLocal_0=9872, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L121] COND TRUE (var_1_14 * var_1_17) >= stepLocal_0 VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L122] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L126] COND FALSE !(var_1_4 < (- var_1_5)) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L133] COND FALSE !(var_1_20 < ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20)))) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L189] RET step() [L190] CALL, EXPR property() [L180] EXPR (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L180-L181] return (((((((! var_1_2) ? (var_1_1 == ((double) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_5)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_5))))) : (var_1_1 == ((double) var_1_4))) && ((var_1_5 > (var_1_3 / var_1_7)) ? ((! var_1_2) ? (var_1_6 == ((signed long int) -10)) : 1) : 1)) && (((var_1_14 * var_1_17) >= var_1_11) ? (var_1_2 ? (var_1_8 == ((float) var_1_4)) : 1) : 1)) && ((var_1_4 <= last_1_var_1_1) ? (var_1_11 == ((signed long int) (last_1_var_1_14 + -128))) : (var_1_11 == ((signed long int) (((((-256) < (last_1_var_1_14)) ? (-256) : (last_1_var_1_14))) + ((((last_1_var_1_17) < (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))) ? (last_1_var_1_17) : (((((last_1_var_1_17) > (256)) ? (last_1_var_1_17) : (256))))))))))) && ((var_1_5 >= var_1_1) ? ((((((1.2) < 0 ) ? -(1.2) : (1.2))) < var_1_4) ? (var_1_14 == ((unsigned short int) var_1_18)) : (var_1_14 == ((unsigned short int) var_1_18))) : 1)) && (var_1_2 ? ((last_1_var_1_8 == var_1_5) ? (((128 * ((((last_1_var_1_18) < (last_1_var_1_11)) ? (last_1_var_1_18) : (last_1_var_1_11)))) > 1) ? (var_1_17 == ((unsigned short int) last_1_var_1_18)) : 1) : (var_1_17 == ((unsigned short int) last_1_var_1_18))) : (var_1_17 == ((unsigned short int) last_1_var_1_18)))) && (((var_1_6 + (var_1_6 | var_1_6)) > var_1_16) ? (var_1_18 == ((unsigned char) (128 - (var_1_19 + var_1_20)))) : 1) ; [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=4, last_1_var_1_14=10000, last_1_var_1_17=4, last_1_var_1_18=100, last_1_var_1_1=513/2, last_1_var_1_8=21/4, var_1_11=9872, var_1_14=10000, var_1_16=0, var_1_17=100, var_1_18=100, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=3, var_1_23=0, var_1_25=0, var_1_26=1, var_1_27=100, var_1_29=100, var_1_2=0, var_1_31=0, var_1_32=32, var_1_34=0, var_1_37=0, var_1_38=100, var_1_39=0, var_1_3=2, var_1_40=1, var_1_4=0, var_1_5=3, var_1_6=-64, var_1_8=21/4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.3s, OverallIterations: 15, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3523 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3523 mSDsluCounter, 6545 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4150 mSDsCounter, 646 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3864 IncrementalHoareTripleChecker+Invalid, 4510 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 646 mSolverCounterUnsat, 2395 mSDtfsCounter, 3864 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 936 GetRequests, 872 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4484occurred in iteration=14, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 14 MinimizatonAttempts, 2826 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 2632 NumberOfCodeBlocks, 2632 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1920 ConstructedInterpolants, 0 QuantifiedInterpolants, 6746 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1083 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 9576/9576 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:24:04,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-76.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 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:24:06,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:24:07,092 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:24:07,102 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:24:07,102 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:24:07,135 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:24:07,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:24:07,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:24:07,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:24:07,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:24:07,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:24:07,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:24:07,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:24:07,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:24:07,137 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:24:07,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:24:07,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:24:07,137 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:24:07,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:24:07,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:24:07,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:24:07,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:24:07,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:24:07,138 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:24:07,138 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:24:07,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:24:07,140 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:24:07,140 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:24:07,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:24:07,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:24:07,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:24:07,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:24:07,140 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:24:07,140 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:24:07,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:24:07,141 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:24:07,142 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 -> 315f810059e4c2a23431a23fb774eb46d4410eb7407045f4b47c8983cf6751e3 [2024-11-07 06:24:07,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:24:07,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:24:07,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:24:07,459 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:24:07,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:24:07,461 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-76.i [2024-11-07 06:24:08,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:24:09,118 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:24:09,123 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-07 06:24:09,138 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2277af5/74da949fb39444dcbc4f4f2b97dbe648/FLAGf065b2fe9 [2024-11-07 06:24:09,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6f2277af5/74da949fb39444dcbc4f4f2b97dbe648 [2024-11-07 06:24:09,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:24:09,165 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:24:09,168 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:24:09,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:24:09,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:24:09,174 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,175 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445a33d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09, skipping insertion in model container [2024-11-07 06:24:09,175 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,196 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:24:09,343 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-76.i[919,932] [2024-11-07 06:24:09,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:24:09,430 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:24:09,444 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-76.i[919,932] [2024-11-07 06:24:09,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:24:09,500 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:24:09,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09 WrapperNode [2024-11-07 06:24:09,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:24:09,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:24:09,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:24:09,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:24:09,511 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:24:09" (1/1) ... [2024-11-07 06:24:09,522 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:24:09" (1/1) ... [2024-11-07 06:24:09,554 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 175 [2024-11-07 06:24:09,554 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:24:09,555 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:24:09,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:24:09,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:24:09,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,589 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:24:09,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:24:09,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:24:09,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:24:09,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:24:09,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (1/1) ... [2024-11-07 06:24:09,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:24:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:24:09,651 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:24:09,655 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:24:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:24:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:24:09,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:24:09,678 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:24:09,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:24:09,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:24:09,780 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:24:09,782 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:24:23,124 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 06:24:23,125 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:24:23,137 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:24:23,137 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:24:23,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:24:23 BoogieIcfgContainer [2024-11-07 06:24:23,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:24:23,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:24:23,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:24:23,145 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:24:23,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:24:09" (1/3) ... [2024-11-07 06:24:23,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ea9de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:24:23, skipping insertion in model container [2024-11-07 06:24:23,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:24:09" (2/3) ... [2024-11-07 06:24:23,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ea9de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:24:23, skipping insertion in model container [2024-11-07 06:24:23,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:24:23" (3/3) ... [2024-11-07 06:24:23,148 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-76.i [2024-11-07 06:24:23,161 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:24:23,162 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:24:23,223 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:24:23,234 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;@651da390, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:24:23,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:24:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-07 06:24:23,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 06:24:23,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:23,257 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:23,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:23,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:23,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1793733614, now seen corresponding path program 1 times [2024-11-07 06:24:23,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:24:23,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2082397405] [2024-11-07 06:24:23,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:23,277 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:24:23,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:24:23,282 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:24:23,284 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:24:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:24,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 06:24:24,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:24:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:24:27,815 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:24:27,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:24:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2082397405] [2024-11-07 06:24:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2082397405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:24:27,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:24:27,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:24:27,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975203691] [2024-11-07 06:24:27,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:24:27,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:24:27,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:24:27,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:24:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:24:27,852 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.509433962264151) internal successors, (80), 54 states have internal predecessors, (80), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:32,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:24:36,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:24:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:24:36,336 INFO L93 Difference]: Finished difference Result 209 states and 376 transitions. [2024-11-07 06:24:36,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:24:36,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 132 [2024-11-07 06:24:36,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:24:36,461 INFO L225 Difference]: With dead ends: 209 [2024-11-07 06:24:36,461 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 06:24:36,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:24:36,471 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 40 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-07 06:24:36,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2024-11-07 06:24:36,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 06:24:36,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2024-11-07 06:24:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-07 06:24:36,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 211 transitions. [2024-11-07 06:24:36,547 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 211 transitions. Word has length 132 [2024-11-07 06:24:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:24:36,548 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 211 transitions. [2024-11-07 06:24:36,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 2 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 211 transitions. [2024-11-07 06:24:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 06:24:36,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:24:36,552 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:36,576 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 (2)] Ended with exit code 0 [2024-11-07 06:24:36,755 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:24:36,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:24:36,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:24:36,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2051899052, now seen corresponding path program 1 times [2024-11-07 06:24:36,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:24:36,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759328860] [2024-11-07 06:24:36,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:24:36,757 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:24:36,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:24:36,759 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:24:36,761 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:24:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:24:37,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 06:24:37,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:24:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-07 06:24:49,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:24:49,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:24:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759328860] [2024-11-07 06:24:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759328860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:24:49,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:24:49,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:24:49,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318493296] [2024-11-07 06:24:49,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:24:49,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 06:24:49,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:24:49,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 06:24:49,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:24:49,117 INFO L87 Difference]: Start difference. First operand 135 states and 211 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-07 06:24:58,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 06:25:02,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []