./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.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_normal_file-6.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', '4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00'] 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_normal_file-6.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 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:34:43,526 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:34:43,603 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:34:43,608 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:34:43,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:34:43,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:34:43,642 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:34:43,642 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:34:43,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:34:43,643 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:34:43,643 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:34:43,643 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:34:43,644 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:34:43,644 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:34:43,644 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:34:43,644 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:34:43,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:34:43,646 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:34:43,647 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:34:43,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:34:43,647 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:34:43,648 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 -> 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 [2024-11-07 04:34:43,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:34:43,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:34:43,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:34:43,927 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:34:43,927 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:34:43,929 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_normal_file-6.i [2024-11-07 04:34:45,194 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:34:45,422 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:34:45,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i [2024-11-07 04:34:45,431 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90878d0c8/a59b5f4b0a3c45b0a64c1ae63eb13145/FLAG4380ce82c [2024-11-07 04:34:45,454 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/90878d0c8/a59b5f4b0a3c45b0a64c1ae63eb13145 [2024-11-07 04:34:45,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:34:45,459 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:34:45,461 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:34:45,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:34:45,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:34:45,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,467 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8c0be0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45, skipping insertion in model container [2024-11-07 04:34:45,467 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:34:45,622 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_normal_file-6.i[912,925] [2024-11-07 04:34:45,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:34:45,697 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:34:45,709 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_normal_file-6.i[912,925] [2024-11-07 04:34:45,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:34:45,759 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:34:45,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45 WrapperNode [2024-11-07 04:34:45,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:34:45,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:34:45,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:34:45,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:34:45,768 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:34:45" (1/1) ... [2024-11-07 04:34:45,775 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:34:45" (1/1) ... [2024-11-07 04:34:45,805 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 128 [2024-11-07 04:34:45,809 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:34:45,810 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:34:45,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:34:45,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:34:45,819 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,819 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,826 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,844 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:34:45,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,857 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,864 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,869 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:34:45,879 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:34:45,879 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:34:45,879 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:34:45,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (1/1) ... [2024-11-07 04:34:45,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:34:45,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:34:45,913 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:34:45,915 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:34:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:34:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:34:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:34:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:34:45,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:34:45,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:34:46,006 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:34:46,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:34:46,213 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 04:34:46,214 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:34:46,225 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:34:46,226 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:34:46,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:46 BoogieIcfgContainer [2024-11-07 04:34:46,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:34:46,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:34:46,229 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:34:46,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:34:46,237 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:34:45" (1/3) ... [2024-11-07 04:34:46,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a22cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:34:46, skipping insertion in model container [2024-11-07 04:34:46,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:45" (2/3) ... [2024-11-07 04:34:46,238 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@747a22cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:34:46, skipping insertion in model container [2024-11-07 04:34:46,238 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:46" (3/3) ... [2024-11-07 04:34:46,240 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-6.i [2024-11-07 04:34:46,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:34:46,255 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:34:46,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:34:46,326 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;@67f2384d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:34:46,326 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:34:46,354 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 04:34:46,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 04:34:46,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:34:46,365 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,365 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:34:46,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:34:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1507269492, now seen corresponding path program 1 times [2024-11-07 04:34:46,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:34:46,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260296047] [2024-11-07 04:34:46,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:34:46,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:34:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:34:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:34:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:34:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:34:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:34:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:34:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:34:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:34:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:34:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:34:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:34:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 04:34:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:34:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:46,716 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 04:34:46,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:34:46,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260296047] [2024-11-07 04:34:46,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260296047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:34:46,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:34:46,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:34:46,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483147969] [2024-11-07 04:34:46,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:34:46,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:34:46,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:34:46,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:34:46,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:34:46,742 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 04:34:46,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:34:46,760 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2024-11-07 04:34:46,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:34:46,762 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-07 04:34:46,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:34:46,767 INFO L225 Difference]: With dead ends: 99 [2024-11-07 04:34:46,768 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 04:34:46,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:34:46,772 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:34:46,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:34:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 04:34:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 04:34:46,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 04:34:46,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-07 04:34:46,813 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2024-11-07 04:34:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:34:46,814 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-07 04:34:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 04:34:46,814 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-07 04:34:46,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 04:34:46,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:34:46,818 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:46,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:34:46,818 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:34:46,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:34:46,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1317533642, now seen corresponding path program 1 times [2024-11-07 04:34:46,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:34:46,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026659782] [2024-11-07 04:34:46,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:34:46,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:34:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:34:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:34:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:34:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:34:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:34:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:34:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:34:47,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:34:47,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:34:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:34:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:34:47,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 04:34:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:34:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 04:34:47,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:34:47,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026659782] [2024-11-07 04:34:47,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026659782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:34:47,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:34:47,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:34:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539770086] [2024-11-07 04:34:47,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:34:47,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:34:47,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:34:47,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:34:47,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:34:47,430 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 04:34:47,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:34:47,571 INFO L93 Difference]: Finished difference Result 142 states and 205 transitions. [2024-11-07 04:34:47,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:34:47,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-07 04:34:47,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:34:47,575 INFO L225 Difference]: With dead ends: 142 [2024-11-07 04:34:47,577 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 04:34:47,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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:34:47,578 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 57 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:34:47,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 194 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:34:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 04:34:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2024-11-07 04:34:47,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 04:34:47,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-07 04:34:47,605 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 91 [2024-11-07 04:34:47,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:34:47,607 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-07 04:34:47,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 04:34:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-07 04:34:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 04:34:47,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:34:47,609 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:47,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:34:47,610 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:34:47,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:34:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2120436618, now seen corresponding path program 1 times [2024-11-07 04:34:47,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:34:47,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924263958] [2024-11-07 04:34:47,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:34:47,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:34:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:34:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:34:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:34:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:34:48,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:34:48,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:34:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:34:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:34:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:34:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:34:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:34:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 04:34:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:34:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 04:34:48,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:34:48,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924263958] [2024-11-07 04:34:48,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924263958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:34:48,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:34:48,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 04:34:48,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868846154] [2024-11-07 04:34:48,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:34:48,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 04:34:48,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:34:48,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 04:34:48,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:34:48,070 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 04:34:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:34:48,345 INFO L93 Difference]: Finished difference Result 203 states and 286 transitions. [2024-11-07 04:34:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:34:48,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 92 [2024-11-07 04:34:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:34:48,350 INFO L225 Difference]: With dead ends: 203 [2024-11-07 04:34:48,350 INFO L226 Difference]: Without dead ends: 157 [2024-11-07 04:34:48,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 04:34:48,352 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 78 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:34:48,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 205 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:34:48,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-07 04:34:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2024-11-07 04:34:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 100 states have (on average 1.23) internal successors, (123), 101 states have internal predecessors, (123), 46 states have call successors, (46), 5 states have call predecessors, (46), 5 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 04:34:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2024-11-07 04:34:48,392 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 92 [2024-11-07 04:34:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:34:48,392 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2024-11-07 04:34:48,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 04:34:48,393 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2024-11-07 04:34:48,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 04:34:48,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:34:48,395 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:48,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:34:48,396 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:34:48,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:34:48,397 INFO L85 PathProgramCache]: Analyzing trace with hash 399523316, now seen corresponding path program 1 times [2024-11-07 04:34:48,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:34:48,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691162281] [2024-11-07 04:34:48,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:34:48,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:34:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:34:48,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 04:34:48,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 04:34:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-07 04:34:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 04:34:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-07 04:34:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 04:34:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-07 04:34:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 04:34:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 04:34:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 04:34:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 04:34:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-07 04:34:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 33 proven. 3 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 04:34:48,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:34:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691162281] [2024-11-07 04:34:48,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691162281] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:34:48,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452854663] [2024-11-07 04:34:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:34:48,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:34:48,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:34:48,938 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:34:48,943 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:34:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:34:49,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 04:34:49,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:34:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2024-11-07 04:34:49,211 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:34:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452854663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:34:49,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:34:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-07 04:34:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314691640] [2024-11-07 04:34:49,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:34:49,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 04:34:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:34:49,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 04:34:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:34:49,215 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 04:34:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:34:49,660 INFO L93 Difference]: Finished difference Result 424 states and 581 transitions. [2024-11-07 04:34:49,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-07 04:34:49,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 92 [2024-11-07 04:34:49,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:34:49,668 INFO L225 Difference]: With dead ends: 424 [2024-11-07 04:34:49,670 INFO L226 Difference]: Without dead ends: 308 [2024-11-07 04:34:49,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380 [2024-11-07 04:34:49,672 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 103 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 04:34:49,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 304 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 04:34:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-07 04:34:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2024-11-07 04:34:49,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 208 states have (on average 1.2067307692307692) internal successors, (251), 210 states have internal predecessors, (251), 79 states have call successors, (79), 18 states have call predecessors, (79), 18 states have return successors, (79), 77 states have call predecessors, (79), 79 states have call successors, (79) [2024-11-07 04:34:49,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 409 transitions. [2024-11-07 04:34:49,749 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 409 transitions. Word has length 92 [2024-11-07 04:34:49,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:34:49,750 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 409 transitions. [2024-11-07 04:34:49,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 04:34:49,751 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 409 transitions. [2024-11-07 04:34:49,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 04:34:49,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:34:49,755 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:49,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 04:34:49,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:34:49,960 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:34:49,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:34:49,960 INFO L85 PathProgramCache]: Analyzing trace with hash 657688754, now seen corresponding path program 1 times [2024-11-07 04:34:49,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:34:49,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362293265] [2024-11-07 04:34:49,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:34:49,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:34:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:34:50,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [632158424] [2024-11-07 04:34:50,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:34:50,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:34:50,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:34:50,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:34:50,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 04:34:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:34:50,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:34:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:34:50,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:34:50,272 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:34:50,272 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:34:50,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 04:34:50,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:34:50,482 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 04:34:50,566 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:34:50,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:34:50 BoogieIcfgContainer [2024-11-07 04:34:50,570 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:34:50,571 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:34:50,571 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:34:50,571 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:34:50,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:34:46" (3/4) ... [2024-11-07 04:34:50,574 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:34:50,574 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:34:50,576 INFO L158 Benchmark]: Toolchain (without parser) took 5116.65ms. 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 49.3MB in the end (delta: 27.3MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2024-11-07 04:34:50,576 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 83.9MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:34:50,577 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.59ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:34:50,578 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.58ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 61.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:34:50,578 INFO L158 Benchmark]: Boogie Preprocessor took 67.90ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 59.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:34:50,578 INFO L158 Benchmark]: RCFGBuilder took 347.71ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 44.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:34:50,579 INFO L158 Benchmark]: TraceAbstraction took 4341.27ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 43.9MB in the beginning and 49.3MB in the end (delta: -5.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2024-11-07 04:34:50,579 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 125.8MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 14.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:34:50,581 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.28ms. Allocated memory is still 83.9MB. Free memory is still 47.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.59ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 63.4MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.58ms. Allocated memory is still 100.7MB. Free memory was 63.3MB in the beginning and 61.5MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.90ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 59.3MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 347.71ms. Allocated memory is still 100.7MB. Free memory was 59.2MB in the beginning and 44.4MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 4341.27ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 43.9MB in the beginning and 49.3MB in the end (delta: -5.4MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 125.8MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 14.7kB). 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 117, overapproximation of someBinaryFLOATComparisonOperation at line 117, overapproximation of someBinaryArithmeticFLOAToperation at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 100.25; [L23] double var_1_5 = 1.9; [L24] double var_1_6 = 7.5; [L25] double var_1_7 = 64.25; [L26] signed long int var_1_8 = 2; [L27] signed long int var_1_9 = 1000000000; [L28] signed long int var_1_10 = 1000000000; [L29] signed long int var_1_11 = 1957998270; [L30] float var_1_12 = 50.25; [L31] float var_1_13 = 9.8; [L32] float var_1_14 = 25.5; [L33] float var_1_15 = 3.5; [L34] signed long int var_1_16 = -500; [L35] unsigned char var_1_17 = 1; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] double last_1_var_1_1 = 100.25; [L39] signed long int last_1_var_1_8 = 2; [L40] float last_1_var_1_12 = 50.25; [L41] signed long int last_1_var_1_16 = -500; [L42] unsigned char last_1_var_1_17 = 1; [L43] unsigned char last_1_var_1_19 = 0; VAL [isInitial=0, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L109] last_1_var_1_1 = var_1_1 [L110] last_1_var_1_8 = var_1_8 [L111] last_1_var_1_12 = var_1_12 [L112] last_1_var_1_16 = var_1_16 [L113] last_1_var_1_17 = var_1_17 [L114] last_1_var_1_19 = var_1_19 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_5=19/10, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L85] var_1_5 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L86] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_6=15/2, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L87] var_1_6 = __VERIFIER_nondet_double() [L88] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L88] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=257/4, var_1_8=2, var_1_9=1000000000] [L89] var_1_7 = __VERIFIER_nondet_double() [L90] CALL assume_abort_if_not((var_1_7 >= 0.0F && 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_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L90] RET assume_abort_if_not((var_1_7 >= 0.0F && 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_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=1000000000] [L91] var_1_9 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_9 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L92] RET assume_abort_if_not(var_1_9 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] CALL assume_abort_if_not(var_1_9 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L93] RET assume_abort_if_not(var_1_9 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=1000000000, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L94] var_1_10 = __VERIFIER_nondet_long() [L95] CALL assume_abort_if_not(var_1_10 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L95] RET assume_abort_if_not(var_1_10 >= 536870911) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] CALL assume_abort_if_not(var_1_10 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L96] RET assume_abort_if_not(var_1_10 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1957998270, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L97] var_1_11 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L98] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] CALL assume_abort_if_not(var_1_11 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L99] RET assume_abort_if_not(var_1_11 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_14=51/2, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L100] var_1_14 = __VERIFIER_nondet_float() [L101] CALL assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L101] RET assume_abort_if_not((var_1_14 >= 0.0F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_15=7/2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L102] var_1_15 = __VERIFIER_nondet_float() [L103] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L103] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L104] var_1_18 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L105] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L106] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L125] RET updateVariables() [L126] CALL step() [L47] COND TRUE \read(last_1_var_1_17) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L48] COND FALSE !(var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L54] COND FALSE !((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=2, var_1_9=536870911] [L61] var_1_8 = (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16))))) [L62] signed long int stepLocal_1 = (((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9)); VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_1=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=201/4, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_8=999, var_1_9=536870911] [L63] COND TRUE stepLocal_1 >= (var_1_16 - var_1_11) [L64] var_1_12 = var_1_7 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L66] var_1_17 = (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18) [L67] signed long int stepLocal_2 = var_1_16; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_2=-500, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_13=49/5, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L68] COND TRUE stepLocal_2 < var_1_11 [L69] var_1_13 = ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L73] signed long int stepLocal_0 = var_1_8; VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=401/4, var_1_7=2, var_1_8=999, var_1_9=536870911] [L74] COND FALSE !(\read(var_1_19)) [L81] var_1_1 = var_1_5 VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, stepLocal_0=999, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L126] RET step() [L127] CALL, EXPR property() [L117-L118] return ((((((var_1_19 ? ((var_1_8 >= var_1_8) ? (var_1_1 == ((double) (var_1_5 + var_1_6))) : (var_1_1 == ((double) (4.125 - var_1_7)))) : (var_1_1 == ((double) var_1_5))) && (var_1_8 == ((signed long int) (((var_1_9 + var_1_10) - last_1_var_1_16) - (var_1_11 - ((((last_1_var_1_16) < 0 ) ? -(last_1_var_1_16) : (last_1_var_1_16)))))))) && ((((((var_1_16) < (var_1_9)) ? (var_1_16) : (var_1_9))) >= (var_1_16 - var_1_11)) ? (var_1_12 == ((float) var_1_7)) : 1)) && ((var_1_16 < var_1_11) ? (var_1_13 == ((float) ((7.3868261718112563E18f - (var_1_14 + var_1_15)) - 5.4f))) : (var_1_13 == ((float) (var_1_15 + ((((var_1_14) < (var_1_5)) ? (var_1_14) : (var_1_5)))))))) && (((((((- var_1_15)) > ((last_1_var_1_12 * var_1_6))) ? ((- var_1_15)) : ((last_1_var_1_12 * var_1_6)))) < var_1_5) ? ((var_1_11 != ((((last_1_var_1_8) < (var_1_10)) ? (last_1_var_1_8) : (var_1_10)))) ? (last_1_var_1_19 ? (var_1_16 == ((signed long int) last_1_var_1_8)) : 1) : 1) : 1)) && (var_1_17 == ((unsigned char) (((var_1_16 * var_1_9) >= ((((var_1_16) > (var_1_8)) ? (var_1_16) : (var_1_8)))) || var_1_18)))) && (last_1_var_1_17 ? ((var_1_7 > (((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))) * (last_1_var_1_1 * 63.375))) ? (var_1_19 == ((unsigned char) var_1_18)) : 1) : (var_1_19 == ((unsigned char) var_1_18))) ; VAL [\result=0, isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=201/4, last_1_var_1_16=-500, last_1_var_1_17=1, last_1_var_1_19=0, last_1_var_1_1=401/4, last_1_var_1_8=2, var_1_10=536870911, var_1_11=1073741823, var_1_12=2, var_1_16=-500, var_1_17=1, var_1_18=1, var_1_19=0, var_1_1=3, var_1_5=3, var_1_7=2, var_1_8=999, var_1_9=536870911] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 5, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 773 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 390 IncrementalHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 283 mSDtfsCounter, 390 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 242 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=306occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 914 SizeOfPredicates, 1 NumberOfNonLiveVariables, 248 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 1557/1560 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:34:50,611 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_normal_file-6.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 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:34:52,746 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:34:52,827 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:34:52,847 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:34:52,848 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:34:52,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:34:52,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:34:52,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:34:52,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:34:52,885 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:34:52,885 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:34:52,885 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:34:52,885 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:34:52,886 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:34:52,886 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:34:52,886 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:34:52,886 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:34:52,886 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:34:52,886 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:34:52,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:34:52,887 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:34:52,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:34:52,888 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:34:52,888 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:34:52,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:34:52,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:34:52,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:34:52,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:34:52,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:34:52,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:34:52,889 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:34:52,889 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:34:52,889 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:34:52,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:34:52,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:34:52,889 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:34:52,890 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:34:52,890 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 -> 4cd105e2e8917dd3f7d377b2f41dc280a12f9a25d3b1400c29b9f9f8c55c6b00 [2024-11-07 04:34:53,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:34:53,163 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:34:53,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:34:53,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:34:53,165 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:34:53,166 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_normal_file-6.i [2024-11-07 04:34:54,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:34:54,695 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:34:54,699 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-6.i [2024-11-07 04:34:54,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ed25ec5c/f72f0928ebdd49eab76e74a6520a5f04/FLAGa95ee5490 [2024-11-07 04:34:54,718 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ed25ec5c/f72f0928ebdd49eab76e74a6520a5f04 [2024-11-07 04:34:54,720 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:34:54,721 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:34:54,723 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:34:54,723 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:34:54,726 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:34:54,727 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:54,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aca0ced and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54, skipping insertion in model container [2024-11-07 04:34:54,727 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:54,740 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:34:54,850 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_normal_file-6.i[912,925] [2024-11-07 04:34:54,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:34:54,915 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:34:54,923 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_normal_file-6.i[912,925] [2024-11-07 04:34:54,949 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:34:54,964 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:34:54,964 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54 WrapperNode [2024-11-07 04:34:54,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:34:54,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:34:54,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:34:54,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:34:54,971 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:34:54" (1/1) ... [2024-11-07 04:34:54,981 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:34:54" (1/1) ... [2024-11-07 04:34:55,016 INFO L138 Inliner]: procedures = 27, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-11-07 04:34:55,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:34:55,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:34:55,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:34:55,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:34:55,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,030 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,049 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:34:55,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,068 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,074 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:34:55,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:34:55,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:34:55,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:34:55,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (1/1) ... [2024-11-07 04:34:55,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:34:55,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:34:55,121 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:34:55,123 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:34:55,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:34:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:34:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:34:55,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:34:55,145 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:34:55,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:34:55,207 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:34:55,208 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:35:13,450 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 04:35:13,450 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:35:13,459 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:35:13,459 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:35:13,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:35:13 BoogieIcfgContainer [2024-11-07 04:35:13,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:35:13,462 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:35:13,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:35:13,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:35:13,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:34:54" (1/3) ... [2024-11-07 04:35:13,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ede2ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:35:13, skipping insertion in model container [2024-11-07 04:35:13,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:34:54" (2/3) ... [2024-11-07 04:35:13,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ede2ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:35:13, skipping insertion in model container [2024-11-07 04:35:13,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:35:13" (3/3) ... [2024-11-07 04:35:13,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-6.i [2024-11-07 04:35:13,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:35:13,481 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:35:13,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:35:13,541 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;@7040adee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:35:13,541 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:35:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 04:35:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 04:35:13,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:35:13,552 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:13,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:35:13,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:35:13,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1507269492, now seen corresponding path program 1 times [2024-11-07 04:35:13,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:35:13,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591272546] [2024-11-07 04:35:13,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:35:13,564 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:35:13,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:35:13,568 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:35:13,569 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:35:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:35:14,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:35:14,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:35:14,326 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2024-11-07 04:35:14,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:35:14,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:35:14,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591272546] [2024-11-07 04:35:14,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591272546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:35:14,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:35:14,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:35:14,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028037001] [2024-11-07 04:35:14,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:35:14,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:35:14,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:35:14,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:35:14,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:35:14,353 INFO L87 Difference]: Start difference. First operand has 53 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 38 states have internal predecessors, (51), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 04:35:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:35:14,375 INFO L93 Difference]: Finished difference Result 99 states and 161 transitions. [2024-11-07 04:35:14,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:35:14,378 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 91 [2024-11-07 04:35:14,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:35:14,384 INFO L225 Difference]: With dead ends: 99 [2024-11-07 04:35:14,384 INFO L226 Difference]: Without dead ends: 49 [2024-11-07 04:35:14,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:35:14,390 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:35:14,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:35:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-07 04:35:14,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-07 04:35:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-07 04:35:14,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 70 transitions. [2024-11-07 04:35:14,431 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 70 transitions. Word has length 91 [2024-11-07 04:35:14,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:35:14,431 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 70 transitions. [2024-11-07 04:35:14,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-07 04:35:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 70 transitions. [2024-11-07 04:35:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-07 04:35:14,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:35:14,437 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:14,467 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:35:14,638 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:35:14,638 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:35:14,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:35:14,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1317533642, now seen corresponding path program 1 times [2024-11-07 04:35:14,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:35:14,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428197808] [2024-11-07 04:35:14,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:35:14,640 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:35:14,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:35:14,642 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:35:14,645 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:35:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:35:15,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 04:35:15,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:35:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-07 04:35:17,782 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:35:17,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:35:17,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428197808] [2024-11-07 04:35:17,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428197808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:35:17,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:35:17,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:35:17,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617416216] [2024-11-07 04:35:17,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:35:17,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:35:17,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:35:17,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:35:17,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:35:17,784 INFO L87 Difference]: Start difference. First operand 49 states and 70 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 04:35:22,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:35:26,339 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:35:30,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:35:34,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:35:34,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:35:34,820 INFO L93 Difference]: Finished difference Result 142 states and 205 transitions. [2024-11-07 04:35:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:35:34,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 91 [2024-11-07 04:35:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:35:34,921 INFO L225 Difference]: With dead ends: 142 [2024-11-07 04:35:34,921 INFO L226 Difference]: Without dead ends: 96 [2024-11-07 04:35:34,922 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:35:34,923 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 27 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.9s IncrementalHoareTripleChecker+Time [2024-11-07 04:35:34,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 195 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 7 Invalid, 4 Unknown, 0 Unchecked, 16.9s Time] [2024-11-07 04:35:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-07 04:35:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 78. [2024-11-07 04:35:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 04:35:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 111 transitions. [2024-11-07 04:35:34,940 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 111 transitions. Word has length 91 [2024-11-07 04:35:34,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:35:34,941 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 111 transitions. [2024-11-07 04:35:34,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-07 04:35:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 111 transitions. [2024-11-07 04:35:34,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-07 04:35:34,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:35:34,943 INFO L215 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:34,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 04:35:35,143 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:35:35,143 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:35:35,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:35:35,144 INFO L85 PathProgramCache]: Analyzing trace with hash -2120436618, now seen corresponding path program 1 times [2024-11-07 04:35:35,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:35:35,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1542322117] [2024-11-07 04:35:35,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:35:35,145 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:35:35,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:35:35,147 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:35:35,148 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:35:35,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:35:35,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:35:35,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:35:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 166 proven. 15 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-07 04:35:40,514 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:35:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 21 proven. 15 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2024-11-07 04:35:43,846 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:35:43,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1542322117] [2024-11-07 04:35:43,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1542322117] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:35:43,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:35:43,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2024-11-07 04:35:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090541760] [2024-11-07 04:35:43,846 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:35:43,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 04:35:43,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:35:43,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 04:35:43,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 04:35:43,848 INFO L87 Difference]: Start difference. First operand 78 states and 111 transitions. Second operand has 12 states, 12 states have (on average 5.25) internal successors, (63), 12 states have internal predecessors, (63), 4 states have call successors, (26), 3 states have call predecessors, (26), 5 states have return successors, (26), 4 states have call predecessors, (26), 4 states have call successors, (26) [2024-11-07 04:35:49,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:35:54,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:35:58,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:36:02,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:36:06,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:36:10,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:36:14,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:36:18,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 04:36:22,493 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 []