./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.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_steplocals_file-58.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', 'cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528'] 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_steplocals_file-58.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 cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:22:58,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:22:58,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:22:58,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:22:58,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:22:58,824 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:22:58,825 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:22:58,825 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:22:58,826 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:22:58,826 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:22:58,827 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:22:58,827 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:22:58,828 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:22:58,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:22:58,828 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:22:58,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:22:58,829 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:22:58,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:22:58,830 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:22:58,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:22:58,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:22:58,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:22:58,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:22:58,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:22:58,830 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 -> cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 [2024-11-07 04:22:59,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:22:59,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:22:59,129 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:22:59,130 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:22:59,130 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:22:59,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-07 04:23:00,438 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:23:00,695 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:23:00,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-07 04:23:00,706 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c14f7005/d1e4615ab7414116bb460f338184dec1/FLAG6306b3a0a [2024-11-07 04:23:00,722 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8c14f7005/d1e4615ab7414116bb460f338184dec1 [2024-11-07 04:23:00,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:23:00,726 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:23:00,728 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:23:00,728 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:23:00,734 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:23:00,735 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:23:00" (1/1) ... [2024-11-07 04:23:00,736 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5345b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:00, skipping insertion in model container [2024-11-07 04:23:00,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:23:00" (1/1) ... [2024-11-07 04:23:00,756 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:23:00,890 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_steplocals_file-58.i[917,930] [2024-11-07 04:23:00,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:23:00,984 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:23:00,994 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_steplocals_file-58.i[917,930] [2024-11-07 04:23:01,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:23:01,061 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:23:01,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01 WrapperNode [2024-11-07 04:23:01,062 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:23:01,063 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:23:01,064 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:23:01,064 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:23:01,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,082 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,136 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-07 04:23:01,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:23:01,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:23:01,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:23:01,138 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:23:01,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,177 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:23:01,178 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,178 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,195 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,202 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:23:01,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:23:01,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:23:01,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:23:01,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (1/1) ... [2024-11-07 04:23:01,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:23:01,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:23:01,245 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:23:01,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:23:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:23:01,272 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:23:01,273 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:23:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:23:01,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:23:01,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:23:01,353 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:23:01,355 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:23:01,669 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 04:23:01,669 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:23:01,679 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:23:01,679 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:23:01,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:01 BoogieIcfgContainer [2024-11-07 04:23:01,681 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:23:01,684 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:23:01,685 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:23:01,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:23:01,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:23:00" (1/3) ... [2024-11-07 04:23:01,691 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577634c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:23:01, skipping insertion in model container [2024-11-07 04:23:01,691 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:01" (2/3) ... [2024-11-07 04:23:01,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@577634c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:23:01, skipping insertion in model container [2024-11-07 04:23:01,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:01" (3/3) ... [2024-11-07 04:23:01,693 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-58.i [2024-11-07 04:23:01,707 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:23:01,708 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:23:01,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:23:01,785 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;@68652ead, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:23:01,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:23:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:23:01,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:01,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:01,804 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:01,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:01,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1900470490, now seen corresponding path program 1 times [2024-11-07 04:23:01,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:01,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143477013] [2024-11-07 04:23:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:23:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:23:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:23:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:23:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:23:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:23:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:23:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:23:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:23:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:23:02,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:23:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:23:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:23:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:23:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:23:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:23:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:23:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:23:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:23:02,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:23:02,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:23:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:23:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:23:02,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:23:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:23:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:23:02,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 04:23:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:23:02,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:02,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:23:02,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:23:02,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143477013] [2024-11-07 04:23:02,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143477013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:23:02,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:23:02,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:23:02,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382693047] [2024-11-07 04:23:02,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:23:02,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:23:02,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:23:02,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:23:02,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:23:02,237 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:23:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:02,259 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2024-11-07 04:23:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:23:02,263 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2024-11-07 04:23:02,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:02,269 INFO L225 Difference]: With dead ends: 145 [2024-11-07 04:23:02,269 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 04:23:02,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:23:02,277 INFO L432 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:02,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:23:02,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 04:23:02,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 04:23:02,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:23:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-11-07 04:23:02,320 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 173 [2024-11-07 04:23:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:02,320 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-11-07 04:23:02,320 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:23:02,320 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-11-07 04:23:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:02,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:02,323 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:02,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:23:02,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:02,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:02,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1011697190, now seen corresponding path program 1 times [2024-11-07 04:23:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716498252] [2024-11-07 04:23:02,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:23:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:23:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:23:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:23:14,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:23:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:23:14,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:23:14,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:23:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:23:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:23:14,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:23:14,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:23:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:23:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:23:14,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:23:14,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:23:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:23:14,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:23:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:23:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:23:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:23:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:23:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:23:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:23:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:23:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:23:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 04:23:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:23:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:23:14,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:23:14,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716498252] [2024-11-07 04:23:14,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716498252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:23:14,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:23:14,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:23:14,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735370433] [2024-11-07 04:23:14,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:23:14,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:23:14,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:23:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:23:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:23:14,502 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:17,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:17,547 INFO L93 Difference]: Finished difference Result 182 states and 265 transitions. [2024-11-07 04:23:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 04:23:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-07 04:23:17,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:17,552 INFO L225 Difference]: With dead ends: 182 [2024-11-07 04:23:17,553 INFO L226 Difference]: Without dead ends: 180 [2024-11-07 04:23:17,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-11-07 04:23:17,555 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 248 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:17,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 662 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 04:23:17,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-07 04:23:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2024-11-07 04:23:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 100 states have (on average 1.29) internal successors, (129), 101 states have internal predecessors, (129), 58 states have call successors, (58), 3 states have call predecessors, (58), 3 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 04:23:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 245 transitions. [2024-11-07 04:23:17,593 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 245 transitions. Word has length 173 [2024-11-07 04:23:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:17,594 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 245 transitions. [2024-11-07 04:23:17,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 245 transitions. [2024-11-07 04:23:17,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:17,596 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:17,596 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:17,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:23:17,597 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:17,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1068955492, now seen corresponding path program 1 times [2024-11-07 04:23:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:17,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313340633] [2024-11-07 04:23:17,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:17,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:17,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:23:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:23:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:23:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:23:24,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:23:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:23:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:23:24,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:23:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:23:24,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:23:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:23:24,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:23:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:23:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:23:24,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:23:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:23:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:23:24,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:23:24,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:23:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:23:24,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:23:24,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:23:24,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:23:24,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:23:24,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:23:24,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:23:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 04:23:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:23:24,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:23:24,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:23:24,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313340633] [2024-11-07 04:23:24,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313340633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:23:24,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:23:24,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 04:23:24,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510779307] [2024-11-07 04:23:24,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:23:24,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 04:23:24,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:23:24,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 04:23:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:23:24,112 INFO L87 Difference]: Start difference. First operand 162 states and 245 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:26,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:26,568 INFO L93 Difference]: Finished difference Result 188 states and 270 transitions. [2024-11-07 04:23:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 04:23:26,568 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-07 04:23:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:26,572 INFO L225 Difference]: With dead ends: 188 [2024-11-07 04:23:26,572 INFO L226 Difference]: Without dead ends: 186 [2024-11-07 04:23:26,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-07 04:23:26,573 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 190 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:26,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 633 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 04:23:26,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-07 04:23:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2024-11-07 04:23:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 103 states have internal predecessors, (130), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 04:23:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2024-11-07 04:23:26,599 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 173 [2024-11-07 04:23:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:26,601 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2024-11-07 04:23:26,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2024-11-07 04:23:26,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:26,606 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:26,607 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:26,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:23:26,607 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:26,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:26,607 INFO L85 PathProgramCache]: Analyzing trace with hash 753531752, now seen corresponding path program 1 times [2024-11-07 04:23:26,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:26,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303467591] [2024-11-07 04:23:26,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:26,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:23:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:23:33,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:23:33,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:23:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:23:33,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:23:33,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:23:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:23:33,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:23:33,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:23:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:23:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:23:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:23:33,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:23:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:23:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:23:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:23:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:23:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:23:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:23:33,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:23:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:23:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:23:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:23:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:23:33,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:23:33,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 04:23:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:23:33,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:23:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:23:33,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303467591] [2024-11-07 04:23:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303467591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:23:33,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:23:33,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 04:23:33,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189326602] [2024-11-07 04:23:33,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:23:33,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 04:23:33,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:23:33,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 04:23:33,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:23:33,607 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:34,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:34,440 INFO L93 Difference]: Finished difference Result 237 states and 338 transitions. [2024-11-07 04:23:34,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 04:23:34,440 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-07 04:23:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:34,442 INFO L225 Difference]: With dead ends: 237 [2024-11-07 04:23:34,443 INFO L226 Difference]: Without dead ends: 235 [2024-11-07 04:23:34,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:23:34,444 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 135 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:34,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 643 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 04:23:34,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-07 04:23:34,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 179. [2024-11-07 04:23:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 116 states have internal predecessors, (147), 58 states have call successors, (58), 5 states have call predecessors, (58), 5 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-07 04:23:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 263 transitions. [2024-11-07 04:23:34,469 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 263 transitions. Word has length 173 [2024-11-07 04:23:34,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:34,470 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 263 transitions. [2024-11-07 04:23:34,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:34,470 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2024-11-07 04:23:34,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:34,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:34,475 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:34,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:23:34,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 810790054, now seen corresponding path program 1 times [2024-11-07 04:23:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:34,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093443961] [2024-11-07 04:23:34,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:23:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:23:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:23:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:23:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:23:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:23:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:23:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:23:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:23:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:23:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:23:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:23:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:23:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:23:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:23:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:23:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:23:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:23:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:23:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:23:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:23:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:23:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:23:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:23:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:23:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:23:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 04:23:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:23:39,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:23:39,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:23:39,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093443961] [2024-11-07 04:23:39,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093443961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:23:39,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:23:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 04:23:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220137471] [2024-11-07 04:23:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:23:39,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 04:23:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:23:39,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 04:23:39,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-07 04:23:39,452 INFO L87 Difference]: Start difference. First operand 179 states and 263 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:40,496 INFO L93 Difference]: Finished difference Result 247 states and 349 transitions. [2024-11-07 04:23:40,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 04:23:40,496 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-07 04:23:40,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:40,498 INFO L225 Difference]: With dead ends: 247 [2024-11-07 04:23:40,498 INFO L226 Difference]: Without dead ends: 245 [2024-11-07 04:23:40,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 04:23:40,499 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 142 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:40,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 874 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 04:23:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-07 04:23:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 199. [2024-11-07 04:23:40,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 134 states have internal predecessors, (171), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:23:40,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2024-11-07 04:23:40,544 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 173 [2024-11-07 04:23:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:40,545 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2024-11-07 04:23:40,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-11-07 04:23:40,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 04:23:40,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:40,547 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:40,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:23:40,547 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:40,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash 892353706, now seen corresponding path program 1 times [2024-11-07 04:23:40,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:40,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007849674] [2024-11-07 04:23:40,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:40,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:23:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:23:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:23:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:23:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 04:23:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:23:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 04:23:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:23:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:23:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:23:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:23:40,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:23:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:23:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:23:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 04:23:40,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 04:23:40,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-07 04:23:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 04:23:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-07 04:23:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 04:23:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-07 04:23:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 04:23:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 04:23:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 04:23:40,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 04:23:40,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-07 04:23:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 04:23:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 04:23:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 04:23:40,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:23:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007849674] [2024-11-07 04:23:40,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007849674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:23:40,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776779574] [2024-11-07 04:23:40,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:40,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:23:40,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:23:40,763 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:23:40,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 04:23:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:40,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:23:40,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:23:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-07 04:23:40,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:23:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-07 04:23:41,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776779574] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 04:23:41,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 04:23:41,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-07 04:23:41,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638953311] [2024-11-07 04:23:41,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 04:23:41,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 04:23:41,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:23:41,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 04:23:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:23:41,172 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-07 04:23:41,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:41,392 INFO L93 Difference]: Finished difference Result 405 states and 587 transitions. [2024-11-07 04:23:41,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 04:23:41,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 174 [2024-11-07 04:23:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:41,396 INFO L225 Difference]: With dead ends: 405 [2024-11-07 04:23:41,396 INFO L226 Difference]: Without dead ends: 209 [2024-11-07 04:23:41,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:23:41,398 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 128 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:41,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 165 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:23:41,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-07 04:23:41,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 196. [2024-11-07 04:23:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 127 states have (on average 1.220472440944882) internal successors, (155), 129 states have internal predecessors, (155), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:23:41,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2024-11-07 04:23:41,427 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 174 [2024-11-07 04:23:41,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:41,428 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2024-11-07 04:23:41,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-07 04:23:41,428 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2024-11-07 04:23:41,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 04:23:41,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:41,430 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:41,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 04:23:41,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:23:41,631 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:41,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:41,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1654830299, now seen corresponding path program 1 times [2024-11-07 04:23:41,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:41,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924027014] [2024-11-07 04:23:41,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:41,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:23:41,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [898838604] [2024-11-07 04:23:41,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:41,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:23:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:23:41,710 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:23:41,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 04:23:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:42,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 04:23:42,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:23:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-07 04:23:43,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:23:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:23:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924027014] [2024-11-07 04:23:43,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 04:23:43,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898838604] [2024-11-07 04:23:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898838604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:23:43,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:23:43,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-07 04:23:43,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524325485] [2024-11-07 04:23:43,236 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-07 04:23:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 04:23:43,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:23:43,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 04:23:43,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 04:23:43,238 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:23:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:43,771 INFO L93 Difference]: Finished difference Result 419 states and 581 transitions. [2024-11-07 04:23:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 04:23:43,772 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-11-07 04:23:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:43,774 INFO L225 Difference]: With dead ends: 419 [2024-11-07 04:23:43,774 INFO L226 Difference]: Without dead ends: 226 [2024-11-07 04:23:43,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 04:23:43,776 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 106 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 13 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:43,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 399 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 329 Invalid, 3 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 04:23:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-07 04:23:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 204. [2024-11-07 04:23:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 136 states have internal predecessors, (163), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 04:23:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2024-11-07 04:23:43,804 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 283 transitions. Word has length 175 [2024-11-07 04:23:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:43,805 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 283 transitions. [2024-11-07 04:23:43,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:23:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 283 transitions. [2024-11-07 04:23:43,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 04:23:43,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:43,807 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:43,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 04:23:44,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:23:44,008 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:44,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:44,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1629019747, now seen corresponding path program 1 times [2024-11-07 04:23:44,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:23:44,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109918165] [2024-11-07 04:23:44,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:44,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:23:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:23:44,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [948577342] [2024-11-07 04:23:44,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:44,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:23:44,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:23:44,083 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 04:23:44,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 04:23:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:23:44,501 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:23:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:23:44,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:23:44,642 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:23:44,643 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:23:44,656 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 04:23:44,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:23:44,854 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:44,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:23:44,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:23:44 BoogieIcfgContainer [2024-11-07 04:23:44,962 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:23:44,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:23:44,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:23:44,963 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:23:44,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:01" (3/4) ... [2024-11-07 04:23:44,965 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:23:44,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:23:44,967 INFO L158 Benchmark]: Toolchain (without parser) took 44240.43ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 77.1MB in the beginning and 890.5MB in the end (delta: -813.4MB). Peak memory consumption was 175.0MB. Max. memory is 16.1GB. [2024-11-07 04:23:44,967 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:23:44,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.66ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 62.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:23:44,967 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.89ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 58.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:23:44,968 INFO L158 Benchmark]: Boogie Preprocessor took 71.54ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 53.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 04:23:44,968 INFO L158 Benchmark]: RCFGBuilder took 471.71ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 68.1MB in the end (delta: -14.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-07 04:23:44,968 INFO L158 Benchmark]: TraceAbstraction took 43277.29ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 67.7MB in the beginning and 890.8MB in the end (delta: -823.1MB). Peak memory consumption was 170.5MB. Max. memory is 16.1GB. [2024-11-07 04:23:44,968 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 1.1GB. Free memory was 890.8MB in the beginning and 890.5MB in the end (delta: 289.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:23:44,970 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.20ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.66ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 62.6MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.89ms. Allocated memory is still 100.7MB. Free memory was 62.5MB in the beginning and 58.9MB in the end (delta: 3.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 71.54ms. Allocated memory is still 100.7MB. Free memory was 58.8MB in the beginning and 53.3MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 471.71ms. Allocated memory is still 100.7MB. Free memory was 53.3MB in the beginning and 68.1MB in the end (delta: -14.9MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 43277.29ms. Allocated memory was 100.7MB in the beginning and 1.1GB in the end (delta: 989.9MB). Free memory was 67.7MB in the beginning and 890.8MB in the end (delta: -823.1MB). Peak memory consumption was 170.5MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 1.1GB. Free memory was 890.8MB in the beginning and 890.5MB in the end (delta: 289.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 140. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 16; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 200; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = 128; [L32] signed short int var_1_11 = 5; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -32; [L35] signed char var_1_14 = 2; [L36] signed char var_1_15 = 25; [L37] signed char var_1_16 = 1; [L38] signed char var_1_17 = 0; [L39] signed long int var_1_18 = -16; [L40] float var_1_19 = 2.775; [L41] unsigned long int var_1_20 = 2381110720; [L42] float var_1_21 = 10000000000000.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_2=25, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] FCALL updateLastVariables() [L148] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] var_1_3 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L104] var_1_5 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L107] var_1_6 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] var_1_8 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L115] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L116] var_1_9 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L117] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L118] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L118] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L119] var_1_13 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L120] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L121] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L121] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L122] var_1_14 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L123] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L124] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L124] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L125] var_1_16 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L126] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L127] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L127] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L128] var_1_17 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L129] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L130] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L130] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L131] var_1_20 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L132] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L133] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L133] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L134] var_1_21 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L135] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L148] RET updateVariables() [L149] CALL step() [L46] COND FALSE !((var_1_2 / var_1_3) <= 2) [L57] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L59] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=32, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L60] COND TRUE stepLocal_0 <= var_1_2 [L61] var_1_10 = ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))) VAL [isInitial=1, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L63] signed long int stepLocal_1 = ((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L64] COND TRUE var_1_1 >= stepLocal_1 [L65] var_1_11 = ((var_1_5 + var_1_2) + var_1_3) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L71] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L72] COND TRUE \read(var_1_7) [L73] var_1_15 = (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L75] signed char stepLocal_2 = var_1_16; VAL [isInitial=1, stepLocal_2=32, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L76] COND TRUE stepLocal_2 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3))) [L77] var_1_18 = (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L81] COND TRUE 100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L82] COND TRUE var_1_20 > 1u VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L83] COND TRUE \read(var_1_9) [L84] var_1_19 = var_1_21 VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L149] RET step() [L150] CALL, EXPR property() [L140-L141] return ((((((((var_1_2 / var_1_3) <= 2) ? ((var_1_3 < (((((~ var_1_2)) < (var_1_4)) ? ((~ var_1_2)) : (var_1_4)))) ? (var_1_1 == ((unsigned char) ((((var_1_5) < (16)) ? (var_1_5) : (16))))) : ((((var_1_6 || var_1_7) && var_1_8) || var_1_9) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5)))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_3 <= var_1_2) ? (var_1_10 == ((signed short int) ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))))) : 1)) && ((var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5)) ? (var_1_11 == ((signed short int) ((var_1_5 + var_1_2) + var_1_3))) : (var_1_8 ? (var_1_11 == ((signed short int) var_1_3)) : 1))) && (var_1_12 == ((signed char) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) && (var_1_7 ? (var_1_15 == ((signed char) (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17))) : 1)) && ((var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3)))) ? (var_1_18 == ((signed long int) (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))))) : (var_1_18 == ((signed long int) 4)))) && ((100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1)) ? ((var_1_20 > 1u) ? (var_1_9 ? (var_1_19 == ((float) var_1_21)) : (var_1_19 == ((float) var_1_21))) : (var_1_19 == ((float) var_1_21))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 3485 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2710 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2096 IncrementalHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 775 mSDtfsCounter, 2096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1004 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 8.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=7, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 176 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 32.0s InterpolantComputationTime, 1913 NumberOfCodeBlocks, 1913 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1553 ConstructedInterpolants, 4 QuantifiedInterpolants, 11173 SizeOfPredicates, 4 NumberOfNonLiveVariables, 757 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 13521/13608 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 04:23:45,187 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-07 04:23:45,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_steplocals_file-58.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 cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:23:47,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:23:47,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:23:47,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:23:47,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:23:47,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:23:47,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:23:47,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:23:47,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:23:47,499 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:23:47,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:23:47,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:23:47,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:23:47,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:23:47,501 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:23:47,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:23:47,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:23:47,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:23:47,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:23:47,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:23:47,503 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 -> cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 [2024-11-07 04:23:47,787 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:23:47,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:23:47,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:23:47,795 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:23:47,796 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:23:47,797 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-07 04:23:49,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:23:49,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:23:49,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-07 04:23:49,465 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca04b9572/23a05969b7c54963a9546f9613a962d7/FLAG0345712b5 [2024-11-07 04:23:49,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ca04b9572/23a05969b7c54963a9546f9613a962d7 [2024-11-07 04:23:49,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:23:49,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:23:49,495 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:23:49,495 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:23:49,502 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:23:49,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c40c92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49, skipping insertion in model container [2024-11-07 04:23:49,503 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:23:49,660 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_steplocals_file-58.i[917,930] [2024-11-07 04:23:49,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:23:49,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:23:49,754 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_steplocals_file-58.i[917,930] [2024-11-07 04:23:49,794 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:23:49,814 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:23:49,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49 WrapperNode [2024-11-07 04:23:49,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:23:49,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:23:49,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:23:49,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:23:49,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,839 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,863 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-07 04:23:49,863 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:23:49,864 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:23:49,864 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:23:49,864 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:23:49,873 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,895 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 04:23:49,896 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,896 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:23:49,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:23:49,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:23:49,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:23:49,931 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (1/1) ... [2024-11-07 04:23:49,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:23:49,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:23:49,966 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 04:23:49,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 04:23:49,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:23:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:23:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:23:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:23:49,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:23:49,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:23:50,076 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:23:50,078 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:23:50,374 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 04:23:50,374 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:23:50,386 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:23:50,387 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:23:50,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:50 BoogieIcfgContainer [2024-11-07 04:23:50,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:23:50,403 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:23:50,404 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:23:50,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:23:50,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:23:49" (1/3) ... [2024-11-07 04:23:50,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595c7069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:23:50, skipping insertion in model container [2024-11-07 04:23:50,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:23:49" (2/3) ... [2024-11-07 04:23:50,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595c7069 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:23:50, skipping insertion in model container [2024-11-07 04:23:50,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:23:50" (3/3) ... [2024-11-07 04:23:50,410 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-58.i [2024-11-07 04:23:50,422 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:23:50,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:23:50,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:23:50,481 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;@4a2f29d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:23:50,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:23:50,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:23:50,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:50,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:50,498 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:50,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:50,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:50,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1900470490, now seen corresponding path program 1 times [2024-11-07 04:23:50,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:23:50,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161362526] [2024-11-07 04:23:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:50,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:23:50,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:23:50,516 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:23:50,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 04:23:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:50,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:23:50,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:23:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-07 04:23:50,806 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:23:50,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:23:50,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161362526] [2024-11-07 04:23:50,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161362526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:23:50,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:23:50,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:23:50,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462737693] [2024-11-07 04:23:50,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:23:50,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:23:50,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:23:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:23:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:23:50,835 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:23:50,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:50,861 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2024-11-07 04:23:50,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:23:50,862 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2024-11-07 04:23:50,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:50,867 INFO L225 Difference]: With dead ends: 145 [2024-11-07 04:23:50,867 INFO L226 Difference]: Without dead ends: 72 [2024-11-07 04:23:50,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:23:50,871 INFO L432 NwaCegarLoop]: 109 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, 109 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:50,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:23:50,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-07 04:23:50,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-07 04:23:50,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:23:50,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-11-07 04:23:50,912 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 173 [2024-11-07 04:23:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:50,913 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-11-07 04:23:50,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:23:50,913 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-11-07 04:23:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:50,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:50,917 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:50,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 04:23:51,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:23:51,118 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:51,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:51,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1011697190, now seen corresponding path program 1 times [2024-11-07 04:23:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:23:51,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434117305] [2024-11-07 04:23:51,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:51,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:23:51,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:23:51,123 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:23:51,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 04:23:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:51,348 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 04:23:51,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:23:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-07 04:23:52,007 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:23:52,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-07 04:23:52,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:23:52,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434117305] [2024-11-07 04:23:52,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434117305] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-07 04:23:52,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-07 04:23:52,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-07 04:23:52,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923129866] [2024-11-07 04:23:52,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:23:52,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:23:52,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:23:52,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:23:52,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 04:23:52,284 INFO L87 Difference]: Start difference. First operand 72 states and 109 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:52,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:23:52,460 INFO L93 Difference]: Finished difference Result 161 states and 243 transitions. [2024-11-07 04:23:52,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:23:52,465 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-07 04:23:52,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:23:52,468 INFO L225 Difference]: With dead ends: 161 [2024-11-07 04:23:52,469 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 04:23:52,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 04:23:52,471 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 28 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:23:52,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 280 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:23:52,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 04:23:52,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2024-11-07 04:23:52,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 04:23:52,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-11-07 04:23:52,488 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 173 [2024-11-07 04:23:52,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:23:52,491 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-11-07 04:23:52,491 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, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-07 04:23:52,492 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-11-07 04:23:52,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 04:23:52,496 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:23:52,496 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:23:52,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 04:23:52,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:23:52,697 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:23:52,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:23:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 753531752, now seen corresponding path program 1 times [2024-11-07 04:23:52,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:23:52,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706877815] [2024-11-07 04:23:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:52,699 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:23:52,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:23:52,703 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:23:52,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 04:23:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:52,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 04:23:52,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:23:52,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-07 04:23:52,949 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:23:53,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:23:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706877815] [2024-11-07 04:23:53,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706877815] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:23:53,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [345882195] [2024-11-07 04:23:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:23:53,046 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 04:23:53,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 04:23:53,050 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 04:23:53,051 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 04:23:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:23:54,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 04:23:54,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:23:56,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-07 04:23:56,552 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:23:57,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [345882195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:23:57,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:23:57,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 11 [2024-11-07 04:23:57,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111012609] [2024-11-07 04:23:57,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:23:57,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 04:23:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:23:57,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 04:23:57,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-07 04:23:57,134 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:24:08,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:24:08,199 INFO L93 Difference]: Finished difference Result 229 states and 338 transitions. [2024-11-07 04:24:08,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 04:24:08,200 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2024-11-07 04:24:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:24:08,205 INFO L225 Difference]: With dead ends: 229 [2024-11-07 04:24:08,205 INFO L226 Difference]: Without dead ends: 158 [2024-11-07 04:24:08,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=225, Invalid=477, Unknown=0, NotChecked=0, Total=702 [2024-11-07 04:24:08,207 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 197 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-07 04:24:08,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 301 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-07 04:24:08,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-07 04:24:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2024-11-07 04:24:08,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.1842105263157894) internal successors, (90), 77 states have internal predecessors, (90), 53 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2024-11-07 04:24:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 196 transitions. [2024-11-07 04:24:08,231 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 196 transitions. Word has length 173 [2024-11-07 04:24:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:24:08,232 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 196 transitions. [2024-11-07 04:24:08,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-07 04:24:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 196 transitions. [2024-11-07 04:24:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 04:24:08,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:24:08,234 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:24:08,243 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 04:24:08,442 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 04:24:08,635 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 04:24:08,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:24:08,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:24:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1629019747, now seen corresponding path program 1 times [2024-11-07 04:24:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:24:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064004716] [2024-11-07 04:24:08,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:24:08,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 04:24:08,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:24:08,641 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 04:24:08,651 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 04:24:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:24:08,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 04:24:08,871 INFO L278 TraceCheckSpWp]: Computing forward predicates...