./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.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_fillercodesize_ps-cn-10_file-30.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', '88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50'] 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_fillercodesize_ps-cn-10_file-30.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 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:53:23,137 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:53:23,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:53:23,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:53:23,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:53:23,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:53:23,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:53:23,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:53:23,250 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:53:23,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:53:23,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:53:23,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:53:23,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:53:23,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:53:23,250 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:53:23,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:53:23,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:53:23,251 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:53:23,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:53:23,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:53:23,253 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:53:23,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:53:23,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:53:23,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:53:23,254 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:53:23,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:53:23,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:53:23,255 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:53:23,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:53:23,255 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:53:23,255 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:53:23,255 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:53:23,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:23,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:53:23,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:53:23,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:53:23,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:53:23,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:53:23,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:53:23,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:53:23,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:53:23,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:53:23,257 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 -> 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 [2024-11-07 04:53:23,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:53:23,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:53:23,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:53:23,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:53:23,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:53:23,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2024-11-07 04:53:24,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:53:25,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:53:25,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2024-11-07 04:53:25,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13d7d6541/a256e16d14c24348879bd80fe8655940/FLAGb815e5b2b [2024-11-07 04:53:25,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/13d7d6541/a256e16d14c24348879bd80fe8655940 [2024-11-07 04:53:25,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:53:25,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:53:25,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:25,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:53:25,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:53:25,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,078 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfac976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25, skipping insertion in model container [2024-11-07 04:53:25,078 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:53:25,230 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_fillercodesize_ps-cn-10_file-30.i[915,928] [2024-11-07 04:53:25,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:25,317 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:53:25,326 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_fillercodesize_ps-cn-10_file-30.i[915,928] [2024-11-07 04:53:25,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:25,385 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:53:25,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25 WrapperNode [2024-11-07 04:53:25,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:25,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:25,390 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:53:25,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:53:25,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,403 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,435 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-07 04:53:25,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:25,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:53:25,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:53:25,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:53:25,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,456 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,478 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 04:53:25,479 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,479 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,505 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:53:25,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:53:25,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:53:25,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:53:25,511 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (1/1) ... [2024-11-07 04:53:25,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:53:25,548 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 04:53:25,554 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 04:53:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:53:25,574 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:53:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:53:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:53:25,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:53:25,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:53:25,670 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:53:25,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:53:25,959 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 04:53:25,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:53:25,968 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:53:25,968 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:53:25,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:25 BoogieIcfgContainer [2024-11-07 04:53:25,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:53:25,971 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:53:25,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:53:25,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:53:25,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:53:25" (1/3) ... [2024-11-07 04:53:25,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af1c4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:25, skipping insertion in model container [2024-11-07 04:53:25,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:25" (2/3) ... [2024-11-07 04:53:25,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af1c4f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:25, skipping insertion in model container [2024-11-07 04:53:25,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:25" (3/3) ... [2024-11-07 04:53:25,979 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2024-11-07 04:53:26,005 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:53:26,005 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:53:26,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:53:26,077 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;@7f8289fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:53:26,077 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:53:26,081 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 04:53:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 04:53:26,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:26,094 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:53:26,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:26,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -378665703, now seen corresponding path program 1 times [2024-11-07 04:53:26,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:26,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889923777] [2024-11-07 04:53:26,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:26,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:53:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:53:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:53:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:53:26,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:53:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:53:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:53:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:53:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:53:26,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:53:26,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:53:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 04:53:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 04:53:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 04:53:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 04:53:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 04:53:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 04:53:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 04:53:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:53:26,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:53:26,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889923777] [2024-11-07 04:53:26,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889923777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:26,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:53:26,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:53:26,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741197972] [2024-11-07 04:53:26,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:26,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:53:26,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:53:26,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:53:26,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:53:26,847 INFO L87 Difference]: Start difference. First operand has 76 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 56 states have internal predecessors, (79), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:53:27,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:27,063 INFO L93 Difference]: Finished difference Result 241 states and 414 transitions. [2024-11-07 04:53:27,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:53:27,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 126 [2024-11-07 04:53:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:27,076 INFO L225 Difference]: With dead ends: 241 [2024-11-07 04:53:27,077 INFO L226 Difference]: Without dead ends: 168 [2024-11-07 04:53:27,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:53:27,085 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 118 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:27,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 338 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:53:27,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-07 04:53:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 139. [2024-11-07 04:53:27,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 100 states have (on average 1.37) internal successors, (137), 100 states have internal predecessors, (137), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:53:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 209 transitions. [2024-11-07 04:53:27,152 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 209 transitions. Word has length 126 [2024-11-07 04:53:27,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:27,154 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 209 transitions. [2024-11-07 04:53:27,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:53:27,155 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 209 transitions. [2024-11-07 04:53:27,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-07 04:53:27,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:27,159 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:53:27,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:53:27,160 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:27,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:27,160 INFO L85 PathProgramCache]: Analyzing trace with hash -834272749, now seen corresponding path program 1 times [2024-11-07 04:53:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:27,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479431570] [2024-11-07 04:53:27,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:27,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:53:27,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:53:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:53:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:53:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:53:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:53:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:53:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:53:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:53:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:53:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:53:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 04:53:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 04:53:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 04:53:27,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 04:53:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 04:53:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 04:53:27,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 04:53:27,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,667 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 04:53:27,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:53:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479431570] [2024-11-07 04:53:27,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479431570] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:53:27,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136723410] [2024-11-07 04:53:27,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:27,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:53:27,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:53:27,672 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 04:53:27,674 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 04:53:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:27,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 04:53:27,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:28,230 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 04:53:28,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:53:28,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 04:53:28,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136723410] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:53:28,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:53:28,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 6] total 13 [2024-11-07 04:53:28,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087783942] [2024-11-07 04:53:28,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:53:28,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 04:53:28,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:53:28,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 04:53:28,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:53:28,524 INFO L87 Difference]: Start difference. First operand 139 states and 209 transitions. Second operand has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-07 04:53:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:28,943 INFO L93 Difference]: Finished difference Result 258 states and 375 transitions. [2024-11-07 04:53:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 04:53:28,944 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) Word has length 127 [2024-11-07 04:53:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:28,946 INFO L225 Difference]: With dead ends: 258 [2024-11-07 04:53:28,946 INFO L226 Difference]: Without dead ends: 189 [2024-11-07 04:53:28,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 284 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=394, Unknown=0, NotChecked=0, Total=552 [2024-11-07 04:53:28,948 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 428 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 429 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:28,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [429 Valid, 284 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:53:28,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-07 04:53:28,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 155. [2024-11-07 04:53:28,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 112 states have (on average 1.3125) internal successors, (147), 112 states have internal predecessors, (147), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:53:28,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 219 transitions. [2024-11-07 04:53:28,984 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 219 transitions. Word has length 127 [2024-11-07 04:53:28,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:28,984 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 219 transitions. [2024-11-07 04:53:28,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-07 04:53:28,985 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 219 transitions. [2024-11-07 04:53:28,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-07 04:53:28,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:28,986 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:53:29,005 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 04:53:29,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:53:29,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:29,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:29,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2117545503, now seen corresponding path program 1 times [2024-11-07 04:53:29,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:29,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472085191] [2024-11-07 04:53:29,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:29,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:29,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:53:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:53:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:53:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 04:53:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:53:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 04:53:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:53:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 04:53:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:53:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:53:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:53:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 04:53:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 04:53:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-07 04:53:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 04:53:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 04:53:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 04:53:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 04:53:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:53:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:53:29,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472085191] [2024-11-07 04:53:29,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472085191] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:29,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:53:29,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:53:29,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177386028] [2024-11-07 04:53:29,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:29,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:53:29,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:53:29,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:53:29,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:53:29,332 INFO L87 Difference]: Start difference. First operand 155 states and 219 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:53:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:53:29,398 INFO L93 Difference]: Finished difference Result 307 states and 435 transitions. [2024-11-07 04:53:29,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:53:29,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 128 [2024-11-07 04:53:29,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:53:29,402 INFO L225 Difference]: With dead ends: 307 [2024-11-07 04:53:29,402 INFO L226 Difference]: Without dead ends: 155 [2024-11-07 04:53:29,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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 04:53:29,405 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:53:29,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:53:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-07 04:53:29,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-07 04:53:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 112 states have internal predecessors, (145), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:53:29,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 217 transitions. [2024-11-07 04:53:29,438 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 217 transitions. Word has length 128 [2024-11-07 04:53:29,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:53:29,440 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 217 transitions. [2024-11-07 04:53:29,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:53:29,441 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 217 transitions. [2024-11-07 04:53:29,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-07 04:53:29,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:29,445 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:53:29,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:53:29,445 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:29,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:29,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1023766462, now seen corresponding path program 1 times [2024-11-07 04:53:29,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:53:29,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729211722] [2024-11-07 04:53:29,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:29,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:53:29,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:53:29,558 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:53:29,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:53:29,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:53:29,648 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:53:29,648 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:53:29,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:53:29,653 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 04:53:29,768 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:53:29,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:53:29 BoogieIcfgContainer [2024-11-07 04:53:29,772 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:53:29,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:53:29,773 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:53:29,773 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:53:29,775 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:25" (3/4) ... [2024-11-07 04:53:29,777 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:53:29,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:53:29,779 INFO L158 Benchmark]: Toolchain (without parser) took 4711.48ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.6MB in the beginning and 74.3MB in the end (delta: 2.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-07 04:53:29,780 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:29,782 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.19ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 62.6MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:53:29,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.71ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:29,782 INFO L158 Benchmark]: Boogie Preprocessor took 71.38ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 58.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:29,782 INFO L158 Benchmark]: RCFGBuilder took 459.12ms. Allocated memory is still 100.7MB. Free memory was 58.2MB in the beginning and 39.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:53:29,783 INFO L158 Benchmark]: TraceAbstraction took 3800.40ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 39.2MB in the beginning and 74.3MB in the end (delta: -35.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:29,783 INFO L158 Benchmark]: Witness Printer took 6.15ms. Allocated memory is still 125.8MB. Free memory was 74.3MB in the beginning and 74.3MB in the end (delta: 30.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:53:29,784 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.25ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.19ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 62.6MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.71ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 60.4MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.38ms. Allocated memory is still 100.7MB. Free memory was 60.4MB in the beginning and 58.2MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 459.12ms. Allocated memory is still 100.7MB. Free memory was 58.2MB in the beginning and 39.9MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3800.40ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 39.2MB in the beginning and 74.3MB in the end (delta: -35.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 6.15ms. Allocated memory is still 125.8MB. Free memory was 74.3MB in the beginning and 74.3MB in the end (delta: 30.0kB). There was no memory consumed. 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 152, overapproximation of someUnaryDOUBLEoperation at line 39, overapproximation of someBinaryArithmeticDOUBLEoperation at line 96. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_4 = 0; [L24] double var_1_5 = 127.5; [L25] double var_1_7 = 10000000000000.125; [L26] double var_1_8 = 1.25; [L27] double var_1_10 = 25.7; [L28] signed long int var_1_11 = -2; [L29] signed long int var_1_13 = 5; [L30] signed long int var_1_14 = 128; [L31] signed long int var_1_15 = 1000; [L32] double var_1_16 = 0.2; [L33] double var_1_17 = 0.25; [L34] double var_1_18 = 99999999999999.5; [L35] signed short int var_1_19 = -64; [L36] double var_1_20 = 256.75; [L37] double var_1_21 = 100.4; [L38] double var_1_22 = 4.5; [L39] double var_1_23 = -0.5; [L40] signed long int var_1_24 = 10; [L41] signed char var_1_25 = -8; [L42] signed char var_1_26 = 10; [L43] signed long int var_1_27 = 256; [L44] unsigned char var_1_28 = 4; [L45] unsigned char var_1_29 = 32; [L46] unsigned char last_1_var_1_1 = 1; [L47] signed long int last_1_var_1_11 = -2; [L48] signed long int last_1_var_1_15 = 1000; [L49] double last_1_var_1_16 = 0.2; VAL [isInitial=0, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L156] isInitial = 1 [L157] FCALL initially() [L158] COND TRUE 1 [L159] CALL updateLastVariables() [L146] last_1_var_1_1 = var_1_1 [L147] last_1_var_1_11 = var_1_11 [L148] last_1_var_1_15 = var_1_15 [L149] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=0, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L159] RET updateLastVariables() [L160] CALL updateVariables() [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L114] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L115] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L115] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_7=80000000000001/8, var_1_8=5/4] [L116] var_1_7 = __VERIFIER_nondet_double() [L117] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L117] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=257/10, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L118] var_1_10 = __VERIFIER_nondet_double() [L119] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L119] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L120] var_1_13 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L121] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L122] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L122] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=128, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L123] var_1_14 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_14 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L124] RET assume_abort_if_not(var_1_14 >= -2147483647) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L125] CALL assume_abort_if_not(var_1_14 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L125] RET assume_abort_if_not(var_1_14 <= 2147483646) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_17=1/4, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L126] var_1_17 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L127] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_18=199999999999999/2, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L128] var_1_18 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L129] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_20=1027/4, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L130] var_1_20 = __VERIFIER_nondet_double() [L131] CALL assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L131] RET assume_abort_if_not((var_1_20 >= -922337.2036854776000e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854776000e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_21=502/5, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L132] var_1_21 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L133] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854776000e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_22=9/2, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L135] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L136] var_1_23 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L137] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=10, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L138] var_1_26 = __VERIFIER_nondet_char() [L139] CALL assume_abort_if_not(var_1_26 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L139] RET assume_abort_if_not(var_1_26 >= -127) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L140] CALL assume_abort_if_not(var_1_26 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L140] RET assume_abort_if_not(var_1_26 <= 126) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=32, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L141] var_1_29 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L142] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L143] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L143] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-64, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L160] RET updateVariables() [L161] CALL step() [L53] COND TRUE (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) - var_1_21) == (var_1_22 * var_1_23) [L54] var_1_19 = -4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=10, var_1_25=-8, var_1_26=-1, var_1_27=256, var_1_28=4, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L56] var_1_24 = var_1_19 [L57] var_1_25 = var_1_26 [L58] var_1_27 = var_1_25 [L59] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L60] COND TRUE \read(last_1_var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=-2, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L61] COND TRUE ((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16 [L62] var_1_11 = ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L67] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_0=-2, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=1, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L68] COND TRUE (last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= stepLocal_0 [L69] var_1_1 = var_1_4 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L71] signed long int stepLocal_2 = var_1_11; [L72] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L73] COND TRUE \read(var_1_1) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, stepLocal_2=0, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L74] COND TRUE var_1_11 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, stepLocal_1=-255, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=255/2, var_1_8=5/4] [L75] COND TRUE stepLocal_1 || (var_1_11 < var_1_11) [L76] var_1_5 = var_1_7 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L82] EXPR var_1_11 & var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=1000, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L82] COND FALSE !((- var_1_11) > (var_1_11 & var_1_13)) [L93] var_1_15 = var_1_13 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_16=1/5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L95] COND TRUE ((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7 [L96] var_1_16 = (var_1_17 + (var_1_18 + 16.75)) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L100] COND TRUE 10.55f < var_1_16 VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=5/4] [L101] COND TRUE var_1_16 > (var_1_7 * var_1_16) [L102] var_1_8 = ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L161] RET step() [L162] CALL, EXPR property() [L152] EXPR ((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13))) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L152-L153] return (((((((last_1_var_1_11 / ((((-16) < 0 ) ? -(-16) : (-16)))) >= last_1_var_1_11) ? (var_1_1 == ((unsigned char) var_1_4)) : 1) && (var_1_1 ? ((var_1_11 >= var_1_11) ? ((var_1_1 || (var_1_11 < var_1_11)) ? (var_1_5 == ((double) var_1_7)) : 1) : (var_1_5 == ((double) var_1_7))) : 1)) && ((10.55f < var_1_16) ? ((var_1_16 > (var_1_7 * var_1_16)) ? (var_1_8 == ((double) ((((var_1_7) > (var_1_10)) ? (var_1_7) : (var_1_10))))) : 1) : ((var_1_16 > var_1_7) ? (var_1_8 == ((double) var_1_10)) : (var_1_8 == ((double) var_1_7))))) && (last_1_var_1_1 ? ((((((last_1_var_1_16) > (49.75)) ? (last_1_var_1_16) : (49.75))) > last_1_var_1_16) ? (var_1_11 == ((signed long int) ((((last_1_var_1_15) < ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14))))) ? (last_1_var_1_15) : ((((((var_1_13 - 5)) > (var_1_14)) ? ((var_1_13 - 5)) : (var_1_14)))))))) : 1) : (var_1_11 == ((signed long int) last_1_var_1_15)))) && (((- var_1_11) > (var_1_11 & var_1_13)) ? ((var_1_11 <= 128) ? (var_1_1 ? (var_1_15 == ((signed long int) var_1_14)) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_14))) : (var_1_15 == ((signed long int) var_1_13)))) && ((((((var_1_5) < (last_1_var_1_16)) ? (var_1_5) : (last_1_var_1_16))) >= var_1_7) ? (var_1_16 == ((double) (var_1_17 + (var_1_18 + 16.75)))) : (var_1_16 == ((double) var_1_17))) ; [L162] RET, EXPR property() [L162] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=-2, last_1_var_1_15=1000, last_1_var_1_16=1/5, last_1_var_1_1=1, var_1_10=100000000000004, var_1_11=0, var_1_13=5, var_1_14=0, var_1_15=5, var_1_19=-4, var_1_1=-255, var_1_24=-4, var_1_25=-1, var_1_26=-1, var_1_27=-1, var_1_28=0, var_1_29=0, var_1_4=-255, var_1_5=100000000000004, var_1_7=100000000000004, var_1_8=100000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 547 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 807 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 477 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 227 IncrementalHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 330 mSDtfsCounter, 227 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 389 GetRequests, 361 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=155occurred in iteration=2, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 63 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 637 NumberOfCodeBlocks, 637 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 630 ConstructedInterpolants, 0 QuantifiedInterpolants, 1522 SizeOfPredicates, 1 NumberOfNonLiveVariables, 319 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2862/3060 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 04:53:29,817 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_fillercodesize_ps-cn-10_file-30.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 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:53:32,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:53:32,116 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:53:32,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:53:32,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:53:32,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:53:32,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:53:32,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:53:32,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:53:32,142 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:53:32,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:53:32,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:53:32,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:53:32,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:53:32,143 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:53:32,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:53:32,144 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:53:32,145 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:53:32,145 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:53:32,145 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:53:32,145 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:53:32,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:53:32,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:53:32,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:53:32,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:53:32,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:53:32,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:53:32,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:32,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:53:32,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:53:32,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:53:32,146 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:53:32,147 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:53:32,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:53:32,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:53:32,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:53:32,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:53:32,147 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 -> 88c823ba6d01c08a1ca0aef14f9fe845aa3afb85e89e5682ca1c816caf454f50 [2024-11-07 04:53:32,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:53:32,432 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:53:32,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:53:32,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:53:32,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:53:32,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2024-11-07 04:53:33,762 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:53:34,011 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:53:34,013 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2024-11-07 04:53:34,023 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ad135e8b/8f2a5b87c6fb4a508bdc679778e56572/FLAG0e594aec2 [2024-11-07 04:53:34,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ad135e8b/8f2a5b87c6fb4a508bdc679778e56572 [2024-11-07 04:53:34,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:53:34,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:53:34,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:34,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:53:34,050 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:53:34,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@568409fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34, skipping insertion in model container [2024-11-07 04:53:34,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:53:34,208 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_fillercodesize_ps-cn-10_file-30.i[915,928] [2024-11-07 04:53:34,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:34,279 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:53:34,287 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_fillercodesize_ps-cn-10_file-30.i[915,928] [2024-11-07 04:53:34,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:53:34,332 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:53:34,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34 WrapperNode [2024-11-07 04:53:34,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:53:34,334 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:34,334 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:53:34,334 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:53:34,340 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,368 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-07 04:53:34,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:53:34,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:53:34,369 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:53:34,370 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:53:34,376 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,381 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,397 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 04:53:34,397 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,397 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,421 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:53:34,422 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:53:34,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:53:34,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:53:34,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (1/1) ... [2024-11-07 04:53:34,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:53:34,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:53:34,459 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 04:53:34,461 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 04:53:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:53:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:53:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:53:34,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:53:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:53:34,478 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:53:34,549 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:53:34,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:53:49,890 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 04:53:49,891 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:53:49,900 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:53:49,901 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:53:49,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:49 BoogieIcfgContainer [2024-11-07 04:53:49,901 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:53:49,922 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:53:49,923 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:53:49,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:53:49,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:53:34" (1/3) ... [2024-11-07 04:53:49,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650ffcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:49, skipping insertion in model container [2024-11-07 04:53:49,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:53:34" (2/3) ... [2024-11-07 04:53:49,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@650ffcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:53:49, skipping insertion in model container [2024-11-07 04:53:49,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:53:49" (3/3) ... [2024-11-07 04:53:49,932 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-30.i [2024-11-07 04:53:49,946 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:53:49,946 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:53:49,998 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:53:50,010 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;@761c9cec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:53:50,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:53:50,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 04:53:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-07 04:53:50,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:53:50,030 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:53:50,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:53:50,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:53:50,035 INFO L85 PathProgramCache]: Analyzing trace with hash 730824334, now seen corresponding path program 1 times [2024-11-07 04:53:50,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:53:50,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83728954] [2024-11-07 04:53:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:53:50,048 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 04:53:50,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:53:50,058 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 04:53:50,060 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 04:53:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:53:50,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 04:53:50,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:53:52,464 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:53:52,465 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:53:52,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:53:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83728954] [2024-11-07 04:53:52,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83728954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:53:52,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:53:52,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:53:52,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976884278] [2024-11-07 04:53:52,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:53:52,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:53:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:53:52,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:53:52,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:53:52,497 INFO L87 Difference]: Start difference. First operand has 67 states, 46 states have (on average 1.4130434782608696) internal successors, (65), 47 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:53:57,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:01,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:03,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:07,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:10,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:10,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:10,535 INFO L93 Difference]: Finished difference Result 205 states and 358 transitions. [2024-11-07 04:54:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:54:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 123 [2024-11-07 04:54:10,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:10,584 INFO L225 Difference]: With dead ends: 205 [2024-11-07 04:54:10,584 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 04:54:10,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:54:10,589 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 87 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 39 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.9s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:10,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 282 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 17 Invalid, 3 Unknown, 0 Unchecked, 17.9s Time] [2024-11-07 04:54:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 04:54:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 121. [2024-11-07 04:54:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.329268292682927) internal successors, (109), 82 states have internal predecessors, (109), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:54:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 181 transitions. [2024-11-07 04:54:10,641 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 181 transitions. Word has length 123 [2024-11-07 04:54:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:10,643 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 181 transitions. [2024-11-07 04:54:10,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:54:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 181 transitions. [2024-11-07 04:54:10,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 04:54:10,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:10,647 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:10,666 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 04:54:10,847 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 04:54:10,848 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:10,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:10,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1093526060, now seen corresponding path program 1 times [2024-11-07 04:54:10,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:10,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809405564] [2024-11-07 04:54:10,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:10,850 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 04:54:10,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:10,852 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 04:54:10,853 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 04:54:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:11,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-07 04:54:11,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:54:14,581 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-07 04:54:14,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:54:16,078 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 04:54:16,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:54:16,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809405564] [2024-11-07 04:54:16,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809405564] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:54:16,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:54:16,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-07 04:54:16,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102157390] [2024-11-07 04:54:16,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:54:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 04:54:16,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:54:16,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 04:54:16,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:54:16,084 INFO L87 Difference]: Start difference. First operand 121 states and 181 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-07 04:54:22,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:26,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:29,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:29,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:29,147 INFO L93 Difference]: Finished difference Result 203 states and 290 transitions. [2024-11-07 04:54:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 04:54:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) Word has length 124 [2024-11-07 04:54:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:29,151 INFO L225 Difference]: With dead ends: 203 [2024-11-07 04:54:29,152 INFO L226 Difference]: Without dead ends: 143 [2024-11-07 04:54:29,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 237 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2024-11-07 04:54:29,153 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 171 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 75 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:29,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 214 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 174 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2024-11-07 04:54:29,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-07 04:54:29,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2024-11-07 04:54:29,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:54:29,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 191 transitions. [2024-11-07 04:54:29,188 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 191 transitions. Word has length 124 [2024-11-07 04:54:29,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:29,190 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 191 transitions. [2024-11-07 04:54:29,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 3 states have call successors, (35), 3 states have call predecessors, (35), 5 states have return successors, (36), 2 states have call predecessors, (36), 3 states have call successors, (36) [2024-11-07 04:54:29,190 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 191 transitions. [2024-11-07 04:54:29,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-07 04:54:29,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:29,193 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:29,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 04:54:29,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:54:29,394 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:29,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1289903288, now seen corresponding path program 1 times [2024-11-07 04:54:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:29,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678600465] [2024-11-07 04:54:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:29,396 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 04:54:29,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:29,398 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:54:29,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 04:54:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:30,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 04:54:30,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:54:30,125 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 04:54:30,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:54:30,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:54:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678600465] [2024-11-07 04:54:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678600465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:54:30,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:54:30,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:54:30,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426618283] [2024-11-07 04:54:30,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:54:30,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:54:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:54:30,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:54:30,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:54:30,130 INFO L87 Difference]: Start difference. First operand 137 states and 191 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:54:34,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:54:34,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:54:34,617 INFO L93 Difference]: Finished difference Result 271 states and 379 transitions. [2024-11-07 04:54:34,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:54:34,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 125 [2024-11-07 04:54:34,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:54:34,620 INFO L225 Difference]: With dead ends: 271 [2024-11-07 04:54:34,620 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 04:54:34,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 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 04:54:34,623 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:54:34,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2024-11-07 04:54:34,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 04:54:34,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-07 04:54:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 94 states have (on average 1.2446808510638299) internal successors, (117), 94 states have internal predecessors, (117), 36 states have call successors, (36), 6 states have call predecessors, (36), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-07 04:54:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2024-11-07 04:54:34,665 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 125 [2024-11-07 04:54:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:54:34,665 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2024-11-07 04:54:34,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 04:54:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2024-11-07 04:54:34,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-07 04:54:34,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:54:34,667 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:54:34,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 04:54:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:54:34,868 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:54:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:54:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 480593929, now seen corresponding path program 1 times [2024-11-07 04:54:34,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:54:34,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820953547] [2024-11-07 04:54:34,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:54:34,869 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 04:54:34,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:54:34,873 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:54:34,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 04:54:35,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:54:35,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-07 04:54:35,476 INFO L278 TraceCheckSpWp]: Computing forward predicates...