./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.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_codestructure_dependencies_file-22.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', '16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1'] 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_codestructure_dependencies_file-22.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 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:54:09,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:54:09,509 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:54:09,515 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:54:09,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:54:09,537 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:54:09,538 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:54:09,538 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:54:09,539 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:54:09,539 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:54:09,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:54:09,539 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:54:09,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:54:09,540 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:54:09,540 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:54:09,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:54:09,541 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:54:09,541 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:54:09,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:54:09,542 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:54:09,542 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:54:09,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:54:09,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:54:09,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:54:09,542 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:54:09,542 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 -> 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 [2024-11-07 03:54:09,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:54:09,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:54:09,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:54:09,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:54:09,815 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:54:09,816 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-07 03:54:10,991 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:54:11,197 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:54:11,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-07 03:54:11,204 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff614b3a/19021657f27e4f0fbb16c815a80f86a4/FLAG4426a2dec [2024-11-07 03:54:11,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/aff614b3a/19021657f27e4f0fbb16c815a80f86a4 [2024-11-07 03:54:11,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:54:11,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:54:11,575 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:54:11,575 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:54:11,578 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:54:11,579 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,579 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5903338c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11, skipping insertion in model container [2024-11-07 03:54:11,579 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:54:11,706 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_codestructure_dependencies_file-22.i[919,932] [2024-11-07 03:54:11,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:54:11,785 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:54:11,797 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_codestructure_dependencies_file-22.i[919,932] [2024-11-07 03:54:11,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:54:11,853 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:54:11,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11 WrapperNode [2024-11-07 03:54:11,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:54:11,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:54:11,856 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:54:11,856 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:54:11,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,922 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2024-11-07 03:54:11,923 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:54:11,924 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:54:11,924 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:54:11,924 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:54:11,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,935 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,963 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 03:54:11,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,982 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,988 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,992 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:11,995 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:54:12,000 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:54:12,000 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:54:12,000 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:54:12,001 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (1/1) ... [2024-11-07 03:54:12,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:54:12,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:54:12,033 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 03:54:12,037 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 03:54:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:54:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:54:12,057 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:54:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:54:12,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:54:12,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:54:12,111 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:54:12,113 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:54:12,436 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 03:54:12,437 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:54:12,444 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:54:12,444 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:54:12,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:12 BoogieIcfgContainer [2024-11-07 03:54:12,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:54:12,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:54:12,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:54:12,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:54:12,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:54:11" (1/3) ... [2024-11-07 03:54:12,451 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d3dbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:12, skipping insertion in model container [2024-11-07 03:54:12,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:11" (2/3) ... [2024-11-07 03:54:12,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32d3dbc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:12, skipping insertion in model container [2024-11-07 03:54:12,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:12" (3/3) ... [2024-11-07 03:54:12,454 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-22.i [2024-11-07 03:54:12,466 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:54:12,466 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:54:12,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:54:12,532 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;@6dd36150, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:54:12,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:54:12,537 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 03:54:12,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 03:54:12,550 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:12,550 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:12,551 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:12,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:12,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2097864758, now seen corresponding path program 1 times [2024-11-07 03:54:12,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:12,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253103476] [2024-11-07 03:54:12,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:12,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:12,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:12,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:12,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:12,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:54:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:54:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:54:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:54:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:54:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:54:12,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 03:54:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 03:54:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 03:54:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 03:54:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 03:54:12,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:12,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253103476] [2024-11-07 03:54:12,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253103476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:12,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:12,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:54:12,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206647552] [2024-11-07 03:54:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:12,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:54:12,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:12,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:54:12,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:54:12,935 INFO L87 Difference]: Start difference. First operand has 70 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 03:54:12,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:12,981 INFO L93 Difference]: Finished difference Result 133 states and 229 transitions. [2024-11-07 03:54:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:54:12,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2024-11-07 03:54:12,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:12,988 INFO L225 Difference]: With dead ends: 133 [2024-11-07 03:54:12,988 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 03:54:12,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 03:54:12,994 INFO L432 NwaCegarLoop]: 98 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, 98 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 03:54:12,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:54:13,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 03:54:13,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-07 03:54:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 states have internal predecessors, (52), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 03:54:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2024-11-07 03:54:13,033 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 148 [2024-11-07 03:54:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:13,033 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2024-11-07 03:54:13,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 03:54:13,034 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2024-11-07 03:54:13,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 03:54:13,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:13,037 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:13,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:54:13,038 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:13,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash -2111931792, now seen corresponding path program 1 times [2024-11-07 03:54:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:13,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148343213] [2024-11-07 03:54:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:13,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:13,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:13,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:13,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:54:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:54:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:54:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:54:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:54:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:54:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 03:54:13,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 03:54:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 03:54:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 03:54:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 03:54:13,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:13,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148343213] [2024-11-07 03:54:13,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148343213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:13,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:13,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:54:13,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747685418] [2024-11-07 03:54:13,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:13,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:54:13,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:13,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:54:13,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:54:13,598 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 03:54:13,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:13,723 INFO L93 Difference]: Finished difference Result 129 states and 193 transitions. [2024-11-07 03:54:13,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:54:13,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 148 [2024-11-07 03:54:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:13,727 INFO L225 Difference]: With dead ends: 129 [2024-11-07 03:54:13,728 INFO L226 Difference]: Without dead ends: 66 [2024-11-07 03:54:13,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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 03:54:13,729 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:13,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 94 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:54:13,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-07 03:54:13,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-07 03:54:13,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 41 states have internal predecessors, (51), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 03:54:13,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2024-11-07 03:54:13,741 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 148 [2024-11-07 03:54:13,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:13,742 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 97 transitions. [2024-11-07 03:54:13,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 03:54:13,742 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 97 transitions. [2024-11-07 03:54:13,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 03:54:13,745 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:13,746 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:13,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:54:13,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:13,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:13,746 INFO L85 PathProgramCache]: Analyzing trace with hash 903171826, now seen corresponding path program 1 times [2024-11-07 03:54:13,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:13,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846174519] [2024-11-07 03:54:13,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:13,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:13,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:14,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:14,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:54:14,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:14,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:54:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:14,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:54:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:54:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:54:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:54:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 03:54:14,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 03:54:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 03:54:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 03:54:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 03:54:14,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846174519] [2024-11-07 03:54:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846174519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 03:54:14,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946924864] [2024-11-07 03:54:14,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:14,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:54:14,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:54:14,575 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 03:54:14,579 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 03:54:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:14,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 03:54:14,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:54:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 651 proven. 66 refuted. 0 times theorem prover too weak. 295 trivial. 0 not checked. [2024-11-07 03:54:15,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:54:15,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 60 proven. 69 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-07 03:54:15,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946924864] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:54:15,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 03:54:15,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 20 [2024-11-07 03:54:15,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968662161] [2024-11-07 03:54:15,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 03:54:15,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-07 03:54:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:15,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-07 03:54:15,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-07 03:54:15,615 INFO L87 Difference]: Start difference. First operand 66 states and 97 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 8 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 8 states have call predecessors, (64), 8 states have call successors, (64) [2024-11-07 03:54:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:16,793 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2024-11-07 03:54:16,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 03:54:16,793 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 8 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 8 states have call predecessors, (64), 8 states have call successors, (64) Word has length 148 [2024-11-07 03:54:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:16,798 INFO L225 Difference]: With dead ends: 240 [2024-11-07 03:54:16,798 INFO L226 Difference]: Without dead ends: 177 [2024-11-07 03:54:16,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=526, Invalid=1454, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 03:54:16,802 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 567 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:16,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 332 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 03:54:16,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-07 03:54:16,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 127. [2024-11-07 03:54:16,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 73 states have (on average 1.1232876712328768) internal successors, (82), 74 states have internal predecessors, (82), 46 states have call successors, (46), 7 states have call predecessors, (46), 7 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 03:54:16,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 174 transitions. [2024-11-07 03:54:16,839 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 174 transitions. Word has length 148 [2024-11-07 03:54:16,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:16,840 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 174 transitions. [2024-11-07 03:54:16,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 8 states have call successors, (63), 3 states have call predecessors, (63), 7 states have return successors, (64), 8 states have call predecessors, (64), 8 states have call successors, (64) [2024-11-07 03:54:16,841 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 174 transitions. [2024-11-07 03:54:16,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 03:54:16,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:16,844 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:16,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 03:54:17,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:54:17,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:17,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1583230196, now seen corresponding path program 1 times [2024-11-07 03:54:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166817334] [2024-11-07 03:54:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:17,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:17,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:17,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:54:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:54:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:17,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:54:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:54:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:54:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:54:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 03:54:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 03:54:17,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 03:54:17,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 03:54:17,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 12 proven. 54 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-07 03:54:17,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166817334] [2024-11-07 03:54:17,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166817334] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 03:54:17,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321568709] [2024-11-07 03:54:17,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:17,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:54:17,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:54:17,529 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 03:54:17,531 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 03:54:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:17,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 03:54:17,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:54:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 338 proven. 102 refuted. 0 times theorem prover too weak. 572 trivial. 0 not checked. [2024-11-07 03:54:18,331 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:54:18,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 24 proven. 105 refuted. 0 times theorem prover too weak. 883 trivial. 0 not checked. [2024-11-07 03:54:18,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321568709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:54:18,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 03:54:18,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 22 [2024-11-07 03:54:18,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999985740] [2024-11-07 03:54:18,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 03:54:18,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 03:54:18,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:18,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 03:54:18,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2024-11-07 03:54:18,735 INFO L87 Difference]: Start difference. First operand 127 states and 174 transitions. Second operand has 22 states, 21 states have (on average 4.857142857142857) internal successors, (102), 20 states have internal predecessors, (102), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2024-11-07 03:54:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:19,953 INFO L93 Difference]: Finished difference Result 340 states and 456 transitions. [2024-11-07 03:54:19,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-07 03:54:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.857142857142857) internal successors, (102), 20 states have internal predecessors, (102), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) Word has length 148 [2024-11-07 03:54:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:19,957 INFO L225 Difference]: With dead ends: 340 [2024-11-07 03:54:19,957 INFO L226 Difference]: Without dead ends: 269 [2024-11-07 03:54:19,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=666, Invalid=1884, Unknown=0, NotChecked=0, Total=2550 [2024-11-07 03:54:19,959 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 477 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:19,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 594 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 03:54:19,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-07 03:54:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 208. [2024-11-07 03:54:20,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 125 states have (on average 1.136) internal successors, (142), 126 states have internal predecessors, (142), 69 states have call successors, (69), 13 states have call predecessors, (69), 13 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2024-11-07 03:54:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 280 transitions. [2024-11-07 03:54:20,008 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 280 transitions. Word has length 148 [2024-11-07 03:54:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:20,010 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 280 transitions. [2024-11-07 03:54:20,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.857142857142857) internal successors, (102), 20 states have internal predecessors, (102), 8 states have call successors, (69), 4 states have call predecessors, (69), 8 states have return successors, (69), 8 states have call predecessors, (69), 8 states have call successors, (69) [2024-11-07 03:54:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 280 transitions. [2024-11-07 03:54:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 03:54:20,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:20,013 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:20,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 03:54:20,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:54:20,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:20,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:20,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1190203186, now seen corresponding path program 1 times [2024-11-07 03:54:20,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:20,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735493034] [2024-11-07 03:54:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:20,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:54:20,271 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:54:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:54:20,371 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:54:20,371 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:54:20,372 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:54:20,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:54:20,376 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-07 03:54:20,466 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:54:20,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:54:20 BoogieIcfgContainer [2024-11-07 03:54:20,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:54:20,469 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:54:20,469 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:54:20,469 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:54:20,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:12" (3/4) ... [2024-11-07 03:54:20,473 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:54:20,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:54:20,475 INFO L158 Benchmark]: Toolchain (without parser) took 8901.31ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 77.3MB in the beginning and 103.1MB in the end (delta: -25.8MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2024-11-07 03:54:20,476 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:54:20,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.58ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 62.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:54:20,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.62ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 58.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:54:20,477 INFO L158 Benchmark]: Boogie Preprocessor took 75.08ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 52.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:54:20,477 INFO L158 Benchmark]: RCFGBuilder took 444.63ms. Allocated memory is still 100.7MB. Free memory was 52.0MB in the beginning and 67.6MB in the end (delta: -15.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-07 03:54:20,478 INFO L158 Benchmark]: TraceAbstraction took 8022.53ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 66.7MB in the beginning and 103.2MB in the end (delta: -36.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-07 03:54:20,478 INFO L158 Benchmark]: Witness Printer took 5.00ms. Allocated memory is still 184.5MB. Free memory was 103.2MB in the beginning and 103.1MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:54:20,479 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.16ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.58ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 62.8MB in the end (delta: 14.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.62ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 58.7MB in the end (delta: 4.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.08ms. Allocated memory is still 100.7MB. Free memory was 58.7MB in the beginning and 52.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 444.63ms. Allocated memory is still 100.7MB. Free memory was 52.0MB in the beginning and 67.6MB in the end (delta: -15.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8022.53ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 66.7MB in the beginning and 103.2MB in the end (delta: -36.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 5.00ms. Allocated memory is still 184.5MB. Free memory was 103.2MB in the beginning and 103.1MB in the end (delta: 45.1kB). 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 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] unsigned short int var_1_4 = 256; [L24] unsigned short int var_1_6 = 10000; [L25] unsigned short int var_1_7 = 10000; [L26] unsigned short int var_1_8 = 128; [L27] unsigned short int var_1_9 = 8; [L28] unsigned char var_1_10 = 100; [L29] unsigned char var_1_11 = 64; [L30] unsigned char var_1_12 = 16; [L31] unsigned short int var_1_13 = 256; [L32] unsigned short int var_1_17 = 4; [L33] double var_1_18 = 64.2; [L34] unsigned short int var_1_19 = 53045; [L35] double var_1_20 = 1.75; [L36] double var_1_21 = 50.35; [L37] double var_1_22 = 5.5; [L38] double var_1_23 = 7.125; [L39] unsigned long int var_1_24 = 50; [L40] unsigned long int var_1_25 = 1907531378; [L41] unsigned long int var_1_26 = 8; [L42] unsigned char var_1_27 = 0; [L43] unsigned long int last_1_var_1_24 = 50; [L44] unsigned char last_1_var_1_27 = 0; VAL [isInitial=0, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=256, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L130] isInitial = 1 [L131] FCALL initially() [L132] COND TRUE 1 [L133] CALL updateLastVariables() [L122] last_1_var_1_24 = var_1_24 [L123] last_1_var_1_27 = var_1_27 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=256, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L133] RET updateLastVariables() [L134] CALL updateVariables() [L84] var_1_4 = __VERIFIER_nondet_ushort() [L85] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L85] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L86] CALL assume_abort_if_not(var_1_4 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L86] RET assume_abort_if_not(var_1_4 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=10000, var_1_7=10000, var_1_8=128, var_1_9=8] [L87] var_1_6 = __VERIFIER_nondet_ushort() [L88] CALL assume_abort_if_not(var_1_6 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L88] RET assume_abort_if_not(var_1_6 >= 8191) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] CALL assume_abort_if_not(var_1_6 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L89] RET assume_abort_if_not(var_1_6 <= 16384) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=10000, var_1_8=128, var_1_9=8] [L90] var_1_7 = __VERIFIER_nondet_ushort() [L91] CALL assume_abort_if_not(var_1_7 >= 8192) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L91] RET assume_abort_if_not(var_1_7 >= 8192) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L92] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L92] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=128, var_1_9=8] [L93] var_1_8 = __VERIFIER_nondet_ushort() [L94] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_9=8] [L94] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_9=8] [L95] CALL assume_abort_if_not(var_1_8 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=8] [L95] RET assume_abort_if_not(var_1_8 <= 16383) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=8] [L96] var_1_9 = __VERIFIER_nondet_ushort() [L97] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1] [L97] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1] [L98] CALL assume_abort_if_not(var_1_9 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L98] RET assume_abort_if_not(var_1_9 <= 32767) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=64, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L99] var_1_11 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L100] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L101] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L101] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=16, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L102] var_1_12 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L103] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L104] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L104] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_18=321/5, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L105] var_1_18 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L106] RET assume_abort_if_not((var_1_18 >= -922337.2036854776000e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854776000e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L107] CALL assume_abort_if_not(var_1_18 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L107] RET assume_abort_if_not(var_1_18 != 0.0F) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=53045, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L108] var_1_19 = __VERIFIER_nondet_ushort() [L109] CALL assume_abort_if_not(var_1_19 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L109] RET assume_abort_if_not(var_1_19 >= 49150) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L110] CALL assume_abort_if_not(var_1_19 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L110] RET assume_abort_if_not(var_1_19 <= 65534) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_21=1007/20, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L111] var_1_21 = __VERIFIER_nondet_double() [L112] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L112] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_22=11/2, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L113] var_1_22 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L114] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_23=57/8, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L115] var_1_23 = __VERIFIER_nondet_double() [L116] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L116] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1907531378, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L117] var_1_25 = __VERIFIER_nondet_ulong() [L118] CALL assume_abort_if_not(var_1_25 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L118] RET assume_abort_if_not(var_1_25 >= 1073741823) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L119] CALL assume_abort_if_not(var_1_25 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L119] RET assume_abort_if_not(var_1_25 <= 2147483647) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=7/4, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L134] RET updateVariables() [L135] CALL step() [L48] COND FALSE !(\read(last_1_var_1_27)) [L51] var_1_20 = var_1_22 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L53] COND TRUE (- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22))) [L54] var_1_27 = 0 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L56] EXPR var_1_8 << var_1_4 VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=100, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L56] COND TRUE var_1_9 < (var_1_8 << var_1_4) [L57] var_1_10 = (var_1_11 + var_1_12) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=256, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L61] COND TRUE (var_1_10 <= var_1_10) || var_1_27 [L62] var_1_13 = ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=50, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L66] COND FALSE !(var_1_7 == last_1_var_1_24) [L69] var_1_24 = (var_1_10 + (var_1_25 - var_1_11)) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L71] COND FALSE !(var_1_10 > (var_1_19 - var_1_7)) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=128, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L74] COND TRUE var_1_20 < var_1_20 [L75] var_1_1 = ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=4, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L79] COND TRUE (var_1_20 / var_1_18) > var_1_20 [L80] var_1_17 = ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L135] RET step() [L136] CALL, EXPR property() [L126] EXPR ((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11))) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L126-L127] return ((((((((var_1_20 < var_1_20) ? (var_1_1 == ((unsigned short int) ((((var_1_10) < (var_1_10)) ? (var_1_10) : (var_1_10))))) : (var_1_1 == ((unsigned short int) (((var_1_6 + var_1_7) - var_1_10) + var_1_10)))) && ((var_1_9 < (var_1_8 << var_1_4)) ? (var_1_10 == ((unsigned char) (var_1_11 + var_1_12))) : (var_1_10 == ((unsigned char) var_1_11)))) && (((var_1_10 <= var_1_10) || var_1_27) ? (var_1_13 == ((unsigned short int) ((((((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) > (var_1_10)) ? (((((var_1_10) > (var_1_10)) ? (var_1_10) : (var_1_10)))) : (var_1_10))))) : (var_1_13 == ((unsigned short int) var_1_10)))) && (((var_1_20 / var_1_18) > var_1_20) ? (var_1_17 == ((unsigned short int) ((var_1_19 - ((((var_1_26) > (var_1_12)) ? (var_1_26) : (var_1_12)))) - var_1_7))) : 1)) && (last_1_var_1_27 ? (var_1_20 == ((double) (((((((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) > (16.6)) ? (((((var_1_21) > (var_1_22)) ? (var_1_21) : (var_1_22)))) : (16.6))) - var_1_23))) : (var_1_20 == ((double) var_1_22)))) && ((var_1_7 == last_1_var_1_24) ? (var_1_24 == ((unsigned long int) (2332545940u - (1490203111u - var_1_11)))) : (var_1_24 == ((unsigned long int) (var_1_10 + (var_1_25 - var_1_11)))))) && ((var_1_10 > (var_1_19 - var_1_7)) ? (var_1_26 == ((unsigned long int) var_1_10)) : 1)) && (((- 3.75) < ((((var_1_20) < (var_1_22)) ? (var_1_20) : (var_1_22)))) ? (var_1_27 == ((unsigned char) 0)) : 1) ; [L136] RET, EXPR property() [L136] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=50, last_1_var_1_27=0, var_1_10=127, var_1_11=127, var_1_12=0, var_1_13=127, var_1_17=49143, var_1_19=-2, var_1_1=127, var_1_20=1907531383, var_1_22=1907531383, var_1_24=1073741823, var_1_25=1073741823, var_1_26=8, var_1_27=0, var_1_4=0, var_1_6=81920, var_1_7=-49153, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 5, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1133 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1126 mSDsluCounter, 1118 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 788 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1265 IncrementalHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 330 mSDtfsCounter, 1265 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 881 GetRequests, 786 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=4, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 111 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1036 NumberOfCodeBlocks, 1036 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1176 ConstructedInterpolants, 0 QuantifiedInterpolants, 6091 SizeOfPredicates, 7 NumberOfNonLiveVariables, 678 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 7682/8096 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 03:54:20,507 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_codestructure_dependencies_file-22.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 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:54:22,376 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:54:22,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 03:54:22,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:54:22,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:54:22,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:54:22,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:54:22,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:54:22,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:54:22,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:54:22,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:54:22,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:54:22,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:54:22,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:54:22,471 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:54:22,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:54:22,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:54:22,472 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:54:22,472 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 -> 16023f56924a3382a4d18bc4360d256726ec148eab6fe3ed9acd8f7224a72ed1 [2024-11-07 03:54:22,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:54:22,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:54:22,746 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:54:22,747 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:54:22,747 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:54:22,749 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-07 03:54:24,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:54:24,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:54:24,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-22.i [2024-11-07 03:54:24,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db87f859b/9de549ef22b745b8b37c080cd9a93eaa/FLAGfc27f8d31 [2024-11-07 03:54:24,250 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db87f859b/9de549ef22b745b8b37c080cd9a93eaa [2024-11-07 03:54:24,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:54:24,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:54:24,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:54:24,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:54:24,260 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:54:24,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c896d30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24, skipping insertion in model container [2024-11-07 03:54:24,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,279 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:54:24,395 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_codestructure_dependencies_file-22.i[919,932] [2024-11-07 03:54:24,453 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:54:24,467 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:54:24,476 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_codestructure_dependencies_file-22.i[919,932] [2024-11-07 03:54:24,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:54:24,508 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:54:24,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24 WrapperNode [2024-11-07 03:54:24,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:54:24,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:54:24,509 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:54:24,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:54:24,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,526 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,550 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-07 03:54:24,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:54:24,551 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:54:24,551 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:54:24,551 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:54:24,558 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,561 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,578 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 03:54:24,579 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,603 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,606 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:54:24,606 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:54:24,606 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:54:24,606 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:54:24,611 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (1/1) ... [2024-11-07 03:54:24,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:54:24,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:54:24,639 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 03:54:24,643 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 03:54:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:54:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:54:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:54:24,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:54:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:54:24,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:54:24,735 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:54:24,736 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:54:37,507 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:54:37,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:54:37,518 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:54:37,518 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:54:37,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:37 BoogieIcfgContainer [2024-11-07 03:54:37,519 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:54:37,521 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:54:37,521 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:54:37,524 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:54:37,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:54:24" (1/3) ... [2024-11-07 03:54:37,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b5e039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:37, skipping insertion in model container [2024-11-07 03:54:37,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:24" (2/3) ... [2024-11-07 03:54:37,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25b5e039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:37, skipping insertion in model container [2024-11-07 03:54:37,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:37" (3/3) ... [2024-11-07 03:54:37,528 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-22.i [2024-11-07 03:54:37,553 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:54:37,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:54:37,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:54:37,599 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;@7495fad5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:54:37,599 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:54:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 03:54:37,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 03:54:37,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:37,611 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:37,611 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:37,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:37,614 INFO L85 PathProgramCache]: Analyzing trace with hash 596666594, now seen corresponding path program 1 times [2024-11-07 03:54:37,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:54:37,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462379506] [2024-11-07 03:54:37,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:37,622 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 03:54:37,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:54:37,625 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 03:54:37,626 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 03:54:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:38,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 03:54:38,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:54:38,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-11-07 03:54:38,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:54:38,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:54:38,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462379506] [2024-11-07 03:54:38,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462379506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:38,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:38,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:54:38,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589923647] [2024-11-07 03:54:38,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:38,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:54:38,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:54:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:54:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:54:38,516 INFO L87 Difference]: Start difference. First operand has 63 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 03:54:38,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:38,538 INFO L93 Difference]: Finished difference Result 119 states and 209 transitions. [2024-11-07 03:54:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:54:38,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 145 [2024-11-07 03:54:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:38,544 INFO L225 Difference]: With dead ends: 119 [2024-11-07 03:54:38,545 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 03:54:38,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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 03:54:38,552 INFO L432 NwaCegarLoop]: 87 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, 87 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 03:54:38,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:54:38,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 03:54:38,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-07 03:54:38,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 03:54:38,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 87 transitions. [2024-11-07 03:54:38,595 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 87 transitions. Word has length 145 [2024-11-07 03:54:38,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:38,596 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 87 transitions. [2024-11-07 03:54:38,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-11-07 03:54:38,597 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 87 transitions. [2024-11-07 03:54:38,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 03:54:38,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:38,600 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:38,625 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 03:54:38,801 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 03:54:38,802 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:38,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:38,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1184184870, now seen corresponding path program 1 times [2024-11-07 03:54:38,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:54:38,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929457540] [2024-11-07 03:54:38,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:38,804 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 03:54:38,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:54:38,806 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 03:54:38,808 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 03:54:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:39,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 03:54:39,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:54:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-11-07 03:54:42,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:54:42,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:54:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929457540] [2024-11-07 03:54:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929457540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:42,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:54:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41627494] [2024-11-07 03:54:42,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:54:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:54:42,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:54:42,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:54:42,489 INFO L87 Difference]: Start difference. First operand 59 states and 87 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 03:54:46,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:54:46,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:46,951 INFO L93 Difference]: Finished difference Result 115 states and 171 transitions. [2024-11-07 03:54:47,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:54:47,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 145 [2024-11-07 03:54:47,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:47,047 INFO L225 Difference]: With dead ends: 115 [2024-11-07 03:54:47,047 INFO L226 Difference]: Without dead ends: 59 [2024-11-07 03:54:47,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 142 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 03:54:47,048 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 48 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:47,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 82 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 3 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-07 03:54:47,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-07 03:54:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-07 03:54:47,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 34 states have internal predecessors, (40), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 03:54:47,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2024-11-07 03:54:47,064 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 86 transitions. Word has length 145 [2024-11-07 03:54:47,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:47,065 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 86 transitions. [2024-11-07 03:54:47,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-11-07 03:54:47,066 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 86 transitions. [2024-11-07 03:54:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 03:54:47,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:47,067 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:54:47,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 03:54:47,267 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 03:54:47,268 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:47,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:47,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1442350308, now seen corresponding path program 1 times [2024-11-07 03:54:47,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:54:47,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705180697] [2024-11-07 03:54:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:47,269 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 03:54:47,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:54:47,273 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 03:54:47,275 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 03:54:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:48,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 03:54:48,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:54:54,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 620 proven. 114 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-07 03:54:54,753 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:54:55,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:54:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705180697] [2024-11-07 03:54:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705180697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 03:54:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1398745206] [2024-11-07 03:54:55,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:55,277 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 03:54:55,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 03:54:55,280 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 03:54:55,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-07 03:54:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-07 03:54:56,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:55:02,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 620 proven. 114 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2024-11-07 03:55:02,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:55:02,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1398745206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 03:55:02,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:55:02,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-07 03:55:02,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741245594] [2024-11-07 03:55:02,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:55:02,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:55:02,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:55:02,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:55:02,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-07 03:55:02,484 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 03:55:10,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:13,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.61s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:18,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:22,428 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 03:55:26,436 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 03:55:30,450 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 03:55:34,456 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 03:55:36,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:36,765 INFO L93 Difference]: Finished difference Result 131 states and 182 transitions. [2024-11-07 03:55:36,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 03:55:36,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 145 [2024-11-07 03:55:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:36,858 INFO L225 Difference]: With dead ends: 131 [2024-11-07 03:55:36,858 INFO L226 Difference]: Without dead ends: 75 [2024-11-07 03:55:36,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-11-07 03:55:36,859 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 42 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 15 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.6s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:36,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 183 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 256 Invalid, 6 Unknown, 0 Unchecked, 33.6s Time] [2024-11-07 03:55:36,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-07 03:55:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-07 03:55:36,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 03:55:36,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-07 03:55:36,871 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 145 [2024-11-07 03:55:36,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:36,871 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-07 03:55:36,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.363636363636363) internal successors, (48), 10 states have internal predecessors, (48), 4 states have call successors, (23), 4 states have call predecessors, (23), 6 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-07 03:55:36,872 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-07 03:55:36,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 03:55:36,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:36,873 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:36,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 03:55:37,093 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-07 03:55:37,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 03:55:37,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:37,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1077609626, now seen corresponding path program 1 times [2024-11-07 03:55:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:55:37,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [517424801] [2024-11-07 03:55:37,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:37,276 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 03:55:37,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:55:37,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:55:37,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 03:55:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:38,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 03:55:38,741 INFO L278 TraceCheckSpWp]: Computing forward predicates...