./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.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_floatingpointinfluence_no-floats_file-28.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', '05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426'] 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_floatingpointinfluence_no-floats_file-28.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 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:46:35,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:46:35,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:46:35,770 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:46:35,770 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:46:35,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:46:35,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:46:35,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:46:35,792 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:46:35,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:46:35,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:46:35,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:46:35,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:46:35,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:46:35,793 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:46:35,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:46:35,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:46:35,793 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:46:35,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:46:35,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:46:35,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:46:35,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:46:35,796 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:46:35,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:46:35,796 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:46:35,796 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:46:35,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:46:35,796 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:46:35,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:46:35,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:46:35,797 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:46:35,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:46:35,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:35,797 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:46:35,798 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:46:35,798 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 -> 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 [2024-11-07 07:46:36,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:46:36,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:46:36,045 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:46:36,046 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:46:36,046 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:46:36,048 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-07 07:46:37,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:46:37,361 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:46:37,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-07 07:46:37,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66f6b46cc/ce855f92de024ea5b2ce4f371d5fb7a0/FLAG1c3b35376 [2024-11-07 07:46:37,742 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/66f6b46cc/ce855f92de024ea5b2ce4f371d5fb7a0 [2024-11-07 07:46:37,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:46:37,745 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:46:37,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:37,746 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:46:37,748 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:46:37,749 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:37,749 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27401e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37, skipping insertion in model container [2024-11-07 07:46:37,749 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:37,759 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:46:37,859 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-07 07:46:37,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:37,894 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:46:37,901 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-07 07:46:37,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:37,928 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:46:37,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37 WrapperNode [2024-11-07 07:46:37,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:37,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:37,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:46:37,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:46:37,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:37,944 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:37,969 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2024-11-07 07:46:37,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:37,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:46:37,973 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:46:37,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:46:37,980 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:37,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:37,982 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:37,997 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 07:46:38,001 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:38,001 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:38,005 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:38,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:38,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:38,017 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:38,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:46:38,019 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:46:38,022 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:46:38,022 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:46:38,023 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (1/1) ... [2024-11-07 07:46:38,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:38,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:46:38,050 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 07:46:38,053 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 07:46:38,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:46:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:46:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:46:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:46:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:46:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:46:38,132 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:46:38,134 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:46:38,319 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:46:38,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:46:38,327 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:46:38,327 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:46:38,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:38 BoogieIcfgContainer [2024-11-07 07:46:38,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:46:38,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:46:38,329 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:46:38,333 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:46:38,333 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:46:37" (1/3) ... [2024-11-07 07:46:38,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56118671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:38, skipping insertion in model container [2024-11-07 07:46:38,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:37" (2/3) ... [2024-11-07 07:46:38,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56118671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:38, skipping insertion in model container [2024-11-07 07:46:38,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:38" (3/3) ... [2024-11-07 07:46:38,335 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-07 07:46:38,345 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:46:38,346 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:46:38,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:46:38,392 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;@3edc07e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:46:38,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:46:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:46:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:46:38,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:38,406 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:38,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:38,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:38,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1007460807, now seen corresponding path program 1 times [2024-11-07 07:46:38,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:38,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465430363] [2024-11-07 07:46:38,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:38,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:38,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:38,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:38,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:38,685 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465430363] [2024-11-07 07:46:38,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465430363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:38,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:38,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:46:38,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254337181] [2024-11-07 07:46:38,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:38,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:46:38,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:38,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:46:38,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:46:38,705 INFO L87 Difference]: Start difference. First operand has 60 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 07:46:38,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:38,725 INFO L93 Difference]: Finished difference Result 113 states and 188 transitions. [2024-11-07 07:46:38,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:46:38,727 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2024-11-07 07:46:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:38,732 INFO L225 Difference]: With dead ends: 113 [2024-11-07 07:46:38,734 INFO L226 Difference]: Without dead ends: 56 [2024-11-07 07:46:38,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 07:46:38,741 INFO L432 NwaCegarLoop]: 79 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, 79 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 07:46:38,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:46:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-07 07:46:38,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-07 07:46:38,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:46:38,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2024-11-07 07:46:38,770 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 116 [2024-11-07 07:46:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:38,770 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2024-11-07 07:46:38,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 07:46:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2024-11-07 07:46:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:46:38,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:38,773 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:38,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:46:38,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:38,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 2128078073, now seen corresponding path program 1 times [2024-11-07 07:46:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:38,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345363274] [2024-11-07 07:46:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:39,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:39,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:39,094 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:39,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:39,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345363274] [2024-11-07 07:46:39,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345363274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:39,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:39,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:46:39,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995477486] [2024-11-07 07:46:39,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:39,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:46:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:39,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:46:39,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:46:39,099 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:39,188 INFO L93 Difference]: Finished difference Result 143 states and 199 transitions. [2024-11-07 07:46:39,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:46:39,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-07 07:46:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:39,190 INFO L225 Difference]: With dead ends: 143 [2024-11-07 07:46:39,190 INFO L226 Difference]: Without dead ends: 90 [2024-11-07 07:46:39,190 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:46:39,191 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 66 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:39,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 162 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:39,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-07 07:46:39,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-07 07:46:39,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 61 states have internal predecessors, (71), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 07:46:39,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 119 transitions. [2024-11-07 07:46:39,203 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 119 transitions. Word has length 116 [2024-11-07 07:46:39,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:39,205 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 119 transitions. [2024-11-07 07:46:39,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:39,205 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 119 transitions. [2024-11-07 07:46:39,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-07 07:46:39,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:39,207 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:39,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:46:39,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:39,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:39,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1869912635, now seen corresponding path program 1 times [2024-11-07 07:46:39,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:39,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104589172] [2024-11-07 07:46:39,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:39,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:40,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:40,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:40,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:40,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:40,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104589172] [2024-11-07 07:46:40,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104589172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:40,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:40,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:46:40,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69995670] [2024-11-07 07:46:40,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:40,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:46:40,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:40,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:46:40,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:46:40,314 INFO L87 Difference]: Start difference. First operand 87 states and 119 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:40,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:40,548 INFO L93 Difference]: Finished difference Result 194 states and 266 transitions. [2024-11-07 07:46:40,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:46:40,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2024-11-07 07:46:40,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:40,550 INFO L225 Difference]: With dead ends: 194 [2024-11-07 07:46:40,551 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 07:46:40,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:46:40,554 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 73 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:40,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 276 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:46:40,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 07:46:40,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-11-07 07:46:40,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.144927536231884) internal successors, (79), 71 states have internal predecessors, (79), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 07:46:40,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2024-11-07 07:46:40,572 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 116 [2024-11-07 07:46:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:40,573 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2024-11-07 07:46:40,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:40,573 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2024-11-07 07:46:40,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 07:46:40,576 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:40,576 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:40,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:46:40,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:40,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:40,577 INFO L85 PathProgramCache]: Analyzing trace with hash 180128188, now seen corresponding path program 1 times [2024-11-07 07:46:40,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:40,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609189940] [2024-11-07 07:46:40,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:40,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:41,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:41,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:41,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:41,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:41,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:41,248 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:41,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:41,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609189940] [2024-11-07 07:46:41,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609189940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:41,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 07:46:41,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382792469] [2024-11-07 07:46:41,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:41,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:46:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:41,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:46:41,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:46:41,249 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:41,515 INFO L93 Difference]: Finished difference Result 204 states and 277 transitions. [2024-11-07 07:46:41,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 07:46:41,517 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-07 07:46:41,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:41,519 INFO L225 Difference]: With dead ends: 204 [2024-11-07 07:46:41,519 INFO L226 Difference]: Without dead ends: 110 [2024-11-07 07:46:41,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:46:41,520 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 38 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:41,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 391 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:46:41,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-07 07:46:41,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 107. [2024-11-07 07:46:41,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 69 states have (on average 1.1304347826086956) internal successors, (78), 71 states have internal predecessors, (78), 34 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 07:46:41,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 146 transitions. [2024-11-07 07:46:41,538 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 146 transitions. Word has length 118 [2024-11-07 07:46:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:41,539 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 146 transitions. [2024-11-07 07:46:41,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:41,539 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 146 transitions. [2024-11-07 07:46:41,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 07:46:41,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:41,540 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:41,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:46:41,540 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:41,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:41,540 INFO L85 PathProgramCache]: Analyzing trace with hash 855559414, now seen corresponding path program 1 times [2024-11-07 07:46:41,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:41,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058701306] [2024-11-07 07:46:41,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:41,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:43,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:43,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:43,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:43,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:43,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:43,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:43,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:43,256 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:43,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:43,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058701306] [2024-11-07 07:46:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058701306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:43,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:43,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:46:43,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418794943] [2024-11-07 07:46:43,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:43,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:46:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:43,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:46:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:46:43,257 INFO L87 Difference]: Start difference. First operand 107 states and 146 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:43,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:43,696 INFO L93 Difference]: Finished difference Result 147 states and 189 transitions. [2024-11-07 07:46:43,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:46:43,696 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-07 07:46:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:43,699 INFO L225 Difference]: With dead ends: 147 [2024-11-07 07:46:43,701 INFO L226 Difference]: Without dead ends: 145 [2024-11-07 07:46:43,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:46:43,702 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 64 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:43,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 522 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:46:43,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-07 07:46:43,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2024-11-07 07:46:43,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 07:46:43,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-11-07 07:46:43,723 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 118 [2024-11-07 07:46:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:43,723 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-11-07 07:46:43,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-11-07 07:46:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-07 07:46:43,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:43,725 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:43,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:46:43,726 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:43,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:43,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1535617784, now seen corresponding path program 1 times [2024-11-07 07:46:43,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:43,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438161566] [2024-11-07 07:46:43,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:43,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:43,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:45,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:45,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:45,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:45,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:45,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438161566] [2024-11-07 07:46:45,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438161566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:45,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:45,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 07:46:45,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969000483] [2024-11-07 07:46:45,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:45,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:46:45,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:45,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:46:45,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:46:45,104 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:45,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:45,493 INFO L93 Difference]: Finished difference Result 154 states and 197 transitions. [2024-11-07 07:46:45,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 07:46:45,493 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2024-11-07 07:46:45,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:45,494 INFO L225 Difference]: With dead ends: 154 [2024-11-07 07:46:45,494 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 07:46:45,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-07 07:46:45,495 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 64 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:45,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 662 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:46:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 07:46:45,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2024-11-07 07:46:45,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 84 states have (on average 1.130952380952381) internal successors, (95), 86 states have internal predecessors, (95), 34 states have call successors, (34), 5 states have call predecessors, (34), 5 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 07:46:45,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-11-07 07:46:45,508 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 118 [2024-11-07 07:46:45,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:45,508 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-11-07 07:46:45,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:45,508 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-11-07 07:46:45,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 07:46:45,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:45,509 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:45,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:46:45,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1795480909, now seen corresponding path program 1 times [2024-11-07 07:46:45,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:45,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226273122] [2024-11-07 07:46:45,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:45,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:45,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:45,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:45,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:45,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:45,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:45,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226273122] [2024-11-07 07:46:45,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226273122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:45,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:45,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:46:45,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247419095] [2024-11-07 07:46:45,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:45,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:46:45,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:45,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:46:45,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:46:45,586 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:45,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:45,639 INFO L93 Difference]: Finished difference Result 261 states and 337 transitions. [2024-11-07 07:46:45,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:46:45,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-07 07:46:45,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:45,640 INFO L225 Difference]: With dead ends: 261 [2024-11-07 07:46:45,640 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 07:46:45,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:46:45,641 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:45,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 151 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:46:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 07:46:45,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2024-11-07 07:46:45,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 102 states have internal predecessors, (110), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:46:45,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 190 transitions. [2024-11-07 07:46:45,660 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 190 transitions. Word has length 120 [2024-11-07 07:46:45,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:45,661 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 190 transitions. [2024-11-07 07:46:45,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:45,661 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 190 transitions. [2024-11-07 07:46:45,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-07 07:46:45,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:45,662 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:45,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:46:45,662 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:45,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:45,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1491412089, now seen corresponding path program 1 times [2024-11-07 07:46:45,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:45,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071357730] [2024-11-07 07:46:45,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:45,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:45,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:45,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:45,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-07 07:46:45,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:45,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071357730] [2024-11-07 07:46:45,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071357730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:45,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:45,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:46:45,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115222190] [2024-11-07 07:46:45,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:45,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:46:45,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:45,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:46:45,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:46:45,720 INFO L87 Difference]: Start difference. First operand 147 states and 190 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:45,757 INFO L93 Difference]: Finished difference Result 286 states and 363 transitions. [2024-11-07 07:46:45,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:46:45,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 120 [2024-11-07 07:46:45,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:45,758 INFO L225 Difference]: With dead ends: 286 [2024-11-07 07:46:45,758 INFO L226 Difference]: Without dead ends: 152 [2024-11-07 07:46:45,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:46:45,759 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 32 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:45,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 133 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:46:45,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-07 07:46:45,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2024-11-07 07:46:45,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 90 states have (on average 1.1) internal successors, (99), 92 states have internal predecessors, (99), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-07 07:46:45,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2024-11-07 07:46:45,776 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 120 [2024-11-07 07:46:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:45,777 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2024-11-07 07:46:45,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-07 07:46:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2024-11-07 07:46:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 07:46:45,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:45,778 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:45,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:46:45,778 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:45,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1674406324, now seen corresponding path program 1 times [2024-11-07 07:46:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906973555] [2024-11-07 07:46:45,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:45,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:46:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:46:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:46:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:46:45,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:46:45,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:46:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:46:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:46:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 07:46:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:46:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 07:46:45,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:46:45,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:46:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:46:45,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:46:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:46:45,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:46:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:46:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:45,930 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 07:46:45,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:46:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906973555] [2024-11-07 07:46:45,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906973555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:46:45,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752007806] [2024-11-07 07:46:45,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:45,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:46:45,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:46:45,933 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 07:46:45,934 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 07:46:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:46,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-07 07:46:46,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:46:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 126 proven. 167 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2024-11-07 07:46:48,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:46:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 12 proven. 39 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 07:46:51,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752007806] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:46:51,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:46:51,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16, 13] total 28 [2024-11-07 07:46:51,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436454805] [2024-11-07 07:46:51,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:46:51,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-07 07:46:51,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:46:51,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-07 07:46:51,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2024-11-07 07:46:51,371 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 28 states have internal predecessors, (93), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-07 07:46:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:51,916 INFO L93 Difference]: Finished difference Result 232 states and 286 transitions. [2024-11-07 07:46:51,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 07:46:51,918 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 28 states have internal predecessors, (93), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 122 [2024-11-07 07:46:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:51,919 INFO L225 Difference]: With dead ends: 232 [2024-11-07 07:46:51,919 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 07:46:51,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 258 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1248, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 07:46:51,920 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 131 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 684 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:51,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 334 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 684 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:46:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 07:46:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2024-11-07 07:46:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 76 states have internal predecessors, (80), 28 states have call successors, (28), 9 states have call predecessors, (28), 9 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 07:46:51,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 136 transitions. [2024-11-07 07:46:51,932 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 136 transitions. Word has length 122 [2024-11-07 07:46:51,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:51,937 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 136 transitions. [2024-11-07 07:46:51,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.3214285714285716) internal successors, (93), 28 states have internal predecessors, (93), 4 states have call successors, (46), 3 states have call predecessors, (46), 6 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2024-11-07 07:46:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 136 transitions. [2024-11-07 07:46:51,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-07 07:46:51,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:51,938 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:51,952 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 07:46:52,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:46:52,139 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:52,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:52,139 INFO L85 PathProgramCache]: Analyzing trace with hash -626416266, now seen corresponding path program 1 times [2024-11-07 07:46:52,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:46:52,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835851491] [2024-11-07 07:46:52,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:52,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:46:52,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:46:52,171 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:46:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:46:52,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:46:52,222 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:46:52,222 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:46:52,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:46:52,226 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:52,299 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:46:52,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:46:52 BoogieIcfgContainer [2024-11-07 07:46:52,304 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:46:52,305 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:46:52,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:46:52,306 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:46:52,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:38" (3/4) ... [2024-11-07 07:46:52,308 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:46:52,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:46:52,309 INFO L158 Benchmark]: Toolchain (without parser) took 14564.24ms. Allocated memory was 100.7MB in the beginning and 645.9MB in the end (delta: 545.3MB). Free memory was 76.7MB in the beginning and 390.5MB in the end (delta: -313.8MB). Peak memory consumption was 234.7MB. Max. memory is 16.1GB. [2024-11-07 07:46:52,309 INFO L158 Benchmark]: CDTParser took 0.21ms. 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 07:46:52,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.39ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 63.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:46:52,310 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.62ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 62.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:46:52,310 INFO L158 Benchmark]: Boogie Preprocessor took 45.42ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:46:52,310 INFO L158 Benchmark]: RCFGBuilder took 308.91ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 44.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:46:52,310 INFO L158 Benchmark]: TraceAbstraction took 13975.34ms. Allocated memory was 100.7MB in the beginning and 645.9MB in the end (delta: 545.3MB). Free memory was 43.4MB in the beginning and 390.6MB in the end (delta: -347.2MB). Peak memory consumption was 192.7MB. Max. memory is 16.1GB. [2024-11-07 07:46:52,311 INFO L158 Benchmark]: Witness Printer took 3.40ms. Allocated memory is still 645.9MB. Free memory was 390.6MB in the beginning and 390.5MB in the end (delta: 169.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:46:52,312 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.21ms. Allocated memory is still 83.9MB. Free memory is still 47.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.39ms. Allocated memory is still 100.7MB. Free memory was 76.5MB in the beginning and 63.8MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.62ms. Allocated memory is still 100.7MB. Free memory was 63.8MB in the beginning and 62.0MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.42ms. Allocated memory is still 100.7MB. Free memory was 62.0MB in the beginning and 59.9MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 308.91ms. Allocated memory is still 100.7MB. Free memory was 59.9MB in the beginning and 44.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13975.34ms. Allocated memory was 100.7MB in the beginning and 645.9MB in the end (delta: 545.3MB). Free memory was 43.4MB in the beginning and 390.6MB in the end (delta: -347.2MB). Peak memory consumption was 192.7MB. Max. memory is 16.1GB. * Witness Printer took 3.40ms. Allocated memory is still 645.9MB. Free memory was 390.6MB in the beginning and 390.5MB in the end (delta: 169.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 1; [L23] signed long int var_1_2 = 63; [L24] signed long int var_1_3 = 255; [L25] signed char var_1_5 = 10; [L26] signed char var_1_6 = 4; [L27] signed char var_1_7 = -10; [L28] signed long int var_1_8 = 4; [L29] signed long int var_1_9 = 99; [L30] signed long int var_1_10 = 255; [L31] signed long int var_1_11 = 24; [L32] signed long int var_1_12 = -2; [L33] signed long int var_1_13 = 1629954775; [L34] signed long int var_1_15 = 1928642731; [L35] signed short int var_1_18 = 0; [L36] unsigned short int var_1_19 = 5; VAL [isInitial=0, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=63, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L95] isInitial = 1 [L96] FCALL initially() [L97] COND TRUE 1 [L98] FCALL updateLastVariables() [L99] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_long() [L61] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L61] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L62] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L62] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=255, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L63] var_1_3 = __VERIFIER_nondet_long() [L64] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L64] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L65] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L65] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=10, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L66] var_1_5 = __VERIFIER_nondet_char() [L67] CALL assume_abort_if_not(var_1_5 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L67] RET assume_abort_if_not(var_1_5 >= -1) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L68] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L68] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=4, var_1_7=-10, var_1_8=4, var_1_9=99] [L69] var_1_6 = __VERIFIER_nondet_char() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L71] CALL assume_abort_if_not(var_1_6 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L71] RET assume_abort_if_not(var_1_6 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-10, var_1_8=4, var_1_9=99] [L72] var_1_7 = __VERIFIER_nondet_char() [L73] CALL assume_abort_if_not(var_1_7 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L73] RET assume_abort_if_not(var_1_7 >= -127) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L74] CALL assume_abort_if_not(var_1_7 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L74] RET assume_abort_if_not(var_1_7 <= 126) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=99] [L75] var_1_9 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L76] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L77] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L77] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, var_1_10=255, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L78] var_1_10 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L79] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L80] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L80] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1629954775, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L81] var_1_13 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_13 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L82] RET assume_abort_if_not(var_1_13 >= 1073741822) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L83] CALL assume_abort_if_not(var_1_13 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L83] RET assume_abort_if_not(var_1_13 <= 2147483646) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=1928642731, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L84] var_1_15 = __VERIFIER_nondet_long() [L85] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L85] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L86] CALL assume_abort_if_not(var_1_15 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L86] RET assume_abort_if_not(var_1_15 <= 2147483646) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L99] RET updateVariables() [L100] CALL step() [L40] signed long int stepLocal_0 = -4; VAL [isInitial=1, stepLocal_0=-4, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=4, var_1_9=-1] [L41] COND TRUE stepLocal_0 < var_1_6 [L42] var_1_8 = ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, var_1_10=-5, var_1_11=24, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=0, var_1_19=5, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L44] var_1_11 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) [L45] var_1_18 = var_1_5 [L46] var_1_19 = var_1_6 VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=1, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L47] COND TRUE (var_1_2 - var_1_3) <= (- var_1_8) [L48] var_1_1 = (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L52] EXPR var_1_6 | 5 VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L52] signed long int stepLocal_1 = var_1_6 | 5; [L53] COND TRUE stepLocal_1 <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7))) [L54] var_1_12 = (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L100] RET step() [L101] CALL, EXPR property() [L91] EXPR (((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19))))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L91] EXPR var_1_6 | 5 VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L91] EXPR (((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19))))) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L91-L92] return (((((((var_1_2 - var_1_3) <= (- var_1_8)) ? (var_1_1 == ((signed char) (((((var_1_5 - var_1_6)) < (var_1_7)) ? ((var_1_5 - var_1_6)) : (var_1_7))))) : (var_1_1 == ((signed char) var_1_5))) && ((-4 < var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1)) && (var_1_11 == ((signed long int) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) && (((var_1_6 | 5) <= ((((var_1_5) > (var_1_7)) ? (var_1_5) : (var_1_7)))) ? (var_1_12 == ((signed long int) (((((var_1_6) < ((var_1_13 - var_1_19))) ? (var_1_6) : ((var_1_13 - var_1_19)))) - (var_1_15 - ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5))))))) : (var_1_12 == ((signed long int) (var_1_6 + (((((var_1_19) < (var_1_19)) ? (var_1_19) : (var_1_19))) - var_1_19)))))) && (var_1_18 == ((signed short int) var_1_5))) && (var_1_19 == ((unsigned short int) var_1_6)) ; [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] [L19] reach_error() VAL [isInitial=1, var_1_10=-5, var_1_11=-1, var_1_12=-2147483394, var_1_13=1073741822, var_1_15=2147483646, var_1_18=126, var_1_19=126, var_1_1=-127, var_1_2=0, var_1_3=0, var_1_5=126, var_1_6=126, var_1_7=-127, var_1_8=-5, var_1_9=-1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 60 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 2710 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1931 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1530 IncrementalHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 779 mSDtfsCounter, 1530 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 658 GetRequests, 581 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147occurred in iteration=7, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 85 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 10.7s InterpolantComputationTime, 1308 NumberOfCodeBlocks, 1308 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1297 ConstructedInterpolants, 0 QuantifiedInterpolants, 6615 SizeOfPredicates, 13 NumberOfNonLiveVariables, 286 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 6493/6732 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 07:46:52,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.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 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:46:54,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:46:54,240 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:46:54,247 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:46:54,247 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:46:54,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:46:54,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:46:54,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:46:54,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:46:54,266 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:46:54,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:46:54,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:46:54,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:46:54,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:46:54,267 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:46:54,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:46:54,268 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:46:54,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:54,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:46:54,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:46:54,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:46:54,269 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:46:54,269 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:46:54,272 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:46:54,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:46:54,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:46:54,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:46:54,272 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 -> 05976cf19c2340bbdfc64774c28749e3f9c87d6988a912aca41569d6eccee426 [2024-11-07 07:46:54,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:46:54,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:46:54,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:46:54,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:46:54,609 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:46:54,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-07 07:46:55,788 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:46:55,967 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:46:55,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-07 07:46:55,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccaf6e632/b2f6aa2380764ed384e8c91719b8e105/FLAG042df2699 [2024-11-07 07:46:55,989 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccaf6e632/b2f6aa2380764ed384e8c91719b8e105 [2024-11-07 07:46:55,991 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:46:55,992 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:46:55,994 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:55,994 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:46:55,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:46:55,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:55" (1/1) ... [2024-11-07 07:46:55,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@582715a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:55, skipping insertion in model container [2024-11-07 07:46:56,000 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:46:55" (1/1) ... [2024-11-07 07:46:56,012 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:46:56,115 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-07 07:46:56,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:56,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:46:56,182 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_floatingpointinfluence_no-floats_file-28.i[916,929] [2024-11-07 07:46:56,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:46:56,223 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:46:56,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56 WrapperNode [2024-11-07 07:46:56,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:46:56,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:56,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:46:56,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:46:56,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,258 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-11-07 07:46:56,259 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:46:56,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:46:56,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:46:56,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:46:56,268 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,268 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,284 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 07:46:56,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,291 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,296 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,300 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,302 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:46:56,306 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:46:56,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:46:56,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:46:56,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (1/1) ... [2024-11-07 07:46:56,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:46:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:46:56,336 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 07:46:56,339 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 07:46:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:46:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:46:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:46:56,357 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:46:56,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:46:56,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:46:56,420 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:46:56,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:46:56,602 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-11-07 07:46:56,602 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:46:56,609 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:46:56,609 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:46:56,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:56 BoogieIcfgContainer [2024-11-07 07:46:56,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:46:56,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:46:56,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:46:56,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:46:56,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:46:55" (1/3) ... [2024-11-07 07:46:56,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6910fe45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:56, skipping insertion in model container [2024-11-07 07:46:56,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:46:56" (2/3) ... [2024-11-07 07:46:56,618 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6910fe45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:46:56, skipping insertion in model container [2024-11-07 07:46:56,618 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:46:56" (3/3) ... [2024-11-07 07:46:56,619 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-28.i [2024-11-07 07:46:56,630 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:46:56,630 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:46:56,670 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:46:56,677 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;@77c6ffb8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:46:56,678 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:46:56,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:46:56,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 07:46:56,688 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:56,689 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:56,690 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:56,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:56,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1196679678, now seen corresponding path program 1 times [2024-11-07 07:46:56,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:46:56,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554908037] [2024-11-07 07:46:56,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:56,724 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 07:46:56,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:46:56,726 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 07:46:56,727 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 07:46:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:56,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:46:56,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:46:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-07 07:46:56,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:46:56,873 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:46:56,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554908037] [2024-11-07 07:46:56,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554908037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:46:56,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:46:56,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:46:56,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432381614] [2024-11-07 07:46:56,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:46:56,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:46:56,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:46:56,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:46:56,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:46:56,892 INFO L87 Difference]: Start difference. First operand has 51 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 07:46:56,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:56,906 INFO L93 Difference]: Finished difference Result 95 states and 160 transitions. [2024-11-07 07:46:56,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:46:56,908 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2024-11-07 07:46:56,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:56,912 INFO L225 Difference]: With dead ends: 95 [2024-11-07 07:46:56,912 INFO L226 Difference]: Without dead ends: 47 [2024-11-07 07:46:56,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 112 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 07:46:56,915 INFO L432 NwaCegarLoop]: 67 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, 67 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 07:46:56,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:46:56,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-07 07:46:56,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-07 07:46:56,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:46:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2024-11-07 07:46:56,947 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 113 [2024-11-07 07:46:56,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:56,948 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2024-11-07 07:46:56,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-07 07:46:56,948 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2024-11-07 07:46:56,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 07:46:56,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:56,951 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:56,955 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 07:46:57,152 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 07:46:57,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:57,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:57,153 INFO L85 PathProgramCache]: Analyzing trace with hash 95620930, now seen corresponding path program 1 times [2024-11-07 07:46:57,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:46:57,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1787907488] [2024-11-07 07:46:57,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:57,154 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 07:46:57,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:46:57,157 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 07:46:57,158 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 07:46:57,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:57,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:46:57,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:46:57,423 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 293 proven. 33 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2024-11-07 07:46:57,423 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:46:57,638 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 18 proven. 33 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-07 07:46:57,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:46:57,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1787907488] [2024-11-07 07:46:57,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1787907488] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:46:57,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:46:57,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-07 07:46:57,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348964210] [2024-11-07 07:46:57,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:46:57,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 07:46:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:46:57,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 07:46:57,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-07 07:46:57,642 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 07:46:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:46:57,868 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2024-11-07 07:46:57,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:46:57,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 113 [2024-11-07 07:46:57,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:46:57,870 INFO L225 Difference]: With dead ends: 97 [2024-11-07 07:46:57,871 INFO L226 Difference]: Without dead ends: 53 [2024-11-07 07:46:57,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:46:57,871 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 45 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:46:57,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 102 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:46:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-07 07:46:57,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2024-11-07 07:46:57,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-07 07:46:57,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2024-11-07 07:46:57,888 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 113 [2024-11-07 07:46:57,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:46:57,888 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2024-11-07 07:46:57,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 states have internal predecessors, (42), 3 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2024-11-07 07:46:57,888 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2024-11-07 07:46:57,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-07 07:46:57,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:46:57,891 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:46:57,896 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 07:46:58,092 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 07:46:58,092 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:46:58,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:46:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash -584437440, now seen corresponding path program 1 times [2024-11-07 07:46:58,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:46:58,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [601760148] [2024-11-07 07:46:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:46:58,093 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 07:46:58,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:46:58,095 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 07:46:58,097 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 07:46:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:46:58,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 07:46:58,188 INFO L278 TraceCheckSpWp]: Computing forward predicates...