./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.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', '3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.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 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:54:52,539 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:54:52,616 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:54:52,620 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:54:52,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:54:52,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:54:52,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:54:52,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:54:52,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:54:52,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:54:52,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:54:52,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:54:52,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:54:52,639 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:54:52,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:54:52,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:54:52,640 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:54:52,640 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:54:52,640 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 -> 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 [2024-11-07 03:54:52,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:54:52,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:54:52,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:54:52,865 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:54:52,866 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:54:52,867 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-11-07 03:54:54,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:54:54,364 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:54:54,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-11-07 03:54:54,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5dd9a6422/c809eb7ce9454c598476bc089d2b5a32/FLAG979f0c7ef [2024-11-07 03:54:54,681 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5dd9a6422/c809eb7ce9454c598476bc089d2b5a32 [2024-11-07 03:54:54,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:54:54,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:54:54,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:54:54,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:54:54,688 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:54:54,689 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:54,689 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f486356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54, skipping insertion in model container [2024-11-07 03:54:54,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:54,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:54:54,810 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-11-07 03:54:54,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:54:54,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:54:54,888 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-11-07 03:54:54,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:54:54,932 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:54:54,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54 WrapperNode [2024-11-07 03:54:54,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:54:54,934 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:54:54,934 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:54:54,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:54:54,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:54,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:54,992 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 146 [2024-11-07 03:54:54,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:54:54,997 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:54:54,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:54:54,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:54:55,005 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,005 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,008 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,020 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 03:54:55,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,027 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,029 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,031 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,034 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:54:55,035 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:54:55,035 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:54:55,035 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:54:55,036 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (1/1) ... [2024-11-07 03:54:55,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:54:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:54:55,062 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 03:54:55,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 03:54:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:54:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:54:55,087 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:54:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:54:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:54:55,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:54:55,153 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:54:55,155 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:54:55,504 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-11-07 03:54:55,504 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:54:55,517 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:54:55,517 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:54:55,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:55 BoogieIcfgContainer [2024-11-07 03:54:55,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:54:55,520 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:54:55,520 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:54:55,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:54:55,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:54:54" (1/3) ... [2024-11-07 03:54:55,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3943ebf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:55, skipping insertion in model container [2024-11-07 03:54:55,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:54:54" (2/3) ... [2024-11-07 03:54:55,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3943ebf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:54:55, skipping insertion in model container [2024-11-07 03:54:55,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:55" (3/3) ... [2024-11-07 03:54:55,528 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-3.i [2024-11-07 03:54:55,540 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:54:55,541 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:54:55,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:54:55,626 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;@24fb5e77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:54:55,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:54:55,633 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 50 states have (on average 1.54) internal successors, (77), 51 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 03:54:55,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 03:54:55,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:55,644 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:54:55,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:55,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:55,650 INFO L85 PathProgramCache]: Analyzing trace with hash 980560379, now seen corresponding path program 1 times [2024-11-07 03:54:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83139279] [2024-11-07 03:54:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:55,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:55,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:55,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:54:55,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:54:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:55,914 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:54:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83139279] [2024-11-07 03:54:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83139279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:54:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705985266] [2024-11-07 03:54:55,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:55,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:54:55,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:54:55,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:54:55,937 INFO L87 Difference]: Start difference. First operand has 68 states, 50 states have (on average 1.54) internal successors, (77), 51 states have internal predecessors, (77), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:54:55,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:55,954 INFO L93 Difference]: Finished difference Result 129 states and 223 transitions. [2024-11-07 03:54:55,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:54:55,955 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 102 [2024-11-07 03:54:55,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:55,960 INFO L225 Difference]: With dead ends: 129 [2024-11-07 03:54:55,961 INFO L226 Difference]: Without dead ends: 64 [2024-11-07 03:54:55,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:54:55,965 INFO L432 NwaCegarLoop]: 99 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, 99 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:55,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:54:55,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-07 03:54:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-07 03:54:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 47 states have internal predecessors, (69), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 03:54:55,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 99 transitions. [2024-11-07 03:54:55,997 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 99 transitions. Word has length 102 [2024-11-07 03:54:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:55,997 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 99 transitions. [2024-11-07 03:54:55,997 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:54:55,998 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 99 transitions. [2024-11-07 03:54:55,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-07 03:54:55,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:55,999 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:54:56,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:54:56,000 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:56,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:56,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1718688377, now seen corresponding path program 1 times [2024-11-07 03:54:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:56,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656496032] [2024-11-07 03:54:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:56,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:56,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:56,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:54:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:54:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:54:56,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:56,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656496032] [2024-11-07 03:54:56,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656496032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:56,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:56,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:54:56,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614272979] [2024-11-07 03:54:56,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:56,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:54:56,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:56,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:54:56,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:54:56,500 INFO L87 Difference]: Start difference. First operand 64 states and 99 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:56,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:56,568 INFO L93 Difference]: Finished difference Result 186 states and 291 transitions. [2024-11-07 03:54:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:54:56,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 102 [2024-11-07 03:54:56,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:56,571 INFO L225 Difference]: With dead ends: 186 [2024-11-07 03:54:56,571 INFO L226 Difference]: Without dead ends: 125 [2024-11-07 03:54:56,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 03:54:56,572 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 60 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:56,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 173 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:54:56,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-07 03:54:56,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-11-07 03:54:56,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 03:54:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 190 transitions. [2024-11-07 03:54:56,588 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 190 transitions. Word has length 102 [2024-11-07 03:54:56,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:56,588 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 190 transitions. [2024-11-07 03:54:56,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 190 transitions. [2024-11-07 03:54:56,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 03:54:56,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:56,589 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:54:56,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:54:56,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:56,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash -512065052, now seen corresponding path program 1 times [2024-11-07 03:54:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:56,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642453940] [2024-11-07 03:54:56,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:56,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:56,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:56,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:56,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:56,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:54:56,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:54:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:56,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:54:56,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:56,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642453940] [2024-11-07 03:54:56,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642453940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:56,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:56,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:54:56,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79896787] [2024-11-07 03:54:56,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:56,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:54:56,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:54:56,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:54:56,784 INFO L87 Difference]: Start difference. First operand 123 states and 190 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:56,892 INFO L93 Difference]: Finished difference Result 355 states and 554 transitions. [2024-11-07 03:54:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:54:56,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-07 03:54:56,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:56,899 INFO L225 Difference]: With dead ends: 355 [2024-11-07 03:54:56,900 INFO L226 Difference]: Without dead ends: 235 [2024-11-07 03:54:56,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 03:54:56,903 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 84 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:56,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 249 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:54:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-07 03:54:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2024-11-07 03:54:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 168 states have (on average 1.4285714285714286) internal successors, (240), 168 states have internal predecessors, (240), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 03:54:56,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 360 transitions. [2024-11-07 03:54:56,950 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 360 transitions. Word has length 103 [2024-11-07 03:54:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:56,951 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 360 transitions. [2024-11-07 03:54:56,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 360 transitions. [2024-11-07 03:54:56,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-07 03:54:56,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:56,955 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:54:56,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:54:56,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:56,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1859589230, now seen corresponding path program 1 times [2024-11-07 03:54:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:56,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739240539] [2024-11-07 03:54:56,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:56,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:57,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:54:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:54:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:54:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739240539] [2024-11-07 03:54:57,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739240539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:57,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:54:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440934555] [2024-11-07 03:54:57,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:57,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:54:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:54:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:54:57,086 INFO L87 Difference]: Start difference. First operand 233 states and 360 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:57,145 INFO L93 Difference]: Finished difference Result 569 states and 878 transitions. [2024-11-07 03:54:57,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:54:57,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 103 [2024-11-07 03:54:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:57,150 INFO L225 Difference]: With dead ends: 569 [2024-11-07 03:54:57,150 INFO L226 Difference]: Without dead ends: 339 [2024-11-07 03:54:57,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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 03:54:57,154 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 41 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:57,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 207 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:54:57,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-07 03:54:57,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 257. [2024-11-07 03:54:57,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 192 states have (on average 1.4375) internal successors, (276), 192 states have internal predecessors, (276), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 03:54:57,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 396 transitions. [2024-11-07 03:54:57,197 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 396 transitions. Word has length 103 [2024-11-07 03:54:57,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:57,197 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 396 transitions. [2024-11-07 03:54:57,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:57,198 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 396 transitions. [2024-11-07 03:54:57,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 03:54:57,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:57,202 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:54:57,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:54:57,202 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:57,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1965300742, now seen corresponding path program 1 times [2024-11-07 03:54:57,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:57,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952174058] [2024-11-07 03:54:57,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:58,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:54:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:54:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-07 03:54:58,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:58,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952174058] [2024-11-07 03:54:58,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952174058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:58,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:58,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 03:54:58,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210883105] [2024-11-07 03:54:58,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:58,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 03:54:58,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:58,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 03:54:58,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:54:58,233 INFO L87 Difference]: Start difference. First operand 257 states and 396 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:59,023 INFO L93 Difference]: Finished difference Result 791 states and 1170 transitions. [2024-11-07 03:54:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 03:54:59,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-07 03:54:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:59,027 INFO L225 Difference]: With dead ends: 791 [2024-11-07 03:54:59,027 INFO L226 Difference]: Without dead ends: 537 [2024-11-07 03:54:59,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-07 03:54:59,029 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 247 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:59,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 309 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 03:54:59,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-07 03:54:59,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 319. [2024-11-07 03:54:59,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 250 states have (on average 1.452) internal successors, (363), 250 states have internal predecessors, (363), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 03:54:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 483 transitions. [2024-11-07 03:54:59,066 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 483 transitions. Word has length 104 [2024-11-07 03:54:59,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:59,067 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 483 transitions. [2024-11-07 03:54:59,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 483 transitions. [2024-11-07 03:54:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 03:54:59,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:59,068 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:54:59,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 03:54:59,068 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:59,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:59,069 INFO L85 PathProgramCache]: Analyzing trace with hash 685437064, now seen corresponding path program 1 times [2024-11-07 03:54:59,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:59,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271252464] [2024-11-07 03:54:59,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:59,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:54:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:54:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:54:59,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:59,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271252464] [2024-11-07 03:54:59,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271252464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:54:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438876413] [2024-11-07 03:54:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:59,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:54:59,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:54:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:54:59,192 INFO L87 Difference]: Start difference. First operand 319 states and 483 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:59,276 INFO L93 Difference]: Finished difference Result 775 states and 1174 transitions. [2024-11-07 03:54:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:54:59,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-11-07 03:54:59,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:59,279 INFO L225 Difference]: With dead ends: 775 [2024-11-07 03:54:59,279 INFO L226 Difference]: Without dead ends: 459 [2024-11-07 03:54:59,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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 03:54:59,280 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 61 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:59,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 201 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:54:59,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-07 03:54:59,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-11-07 03:54:59,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 354 states have (on average 1.4378531073446328) internal successors, (509), 354 states have internal predecessors, (509), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 03:54:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 689 transitions. [2024-11-07 03:54:59,315 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 689 transitions. Word has length 104 [2024-11-07 03:54:59,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:54:59,315 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 689 transitions. [2024-11-07 03:54:59,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:54:59,315 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 689 transitions. [2024-11-07 03:54:59,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-07 03:54:59,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:54:59,316 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:54:59,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 03:54:59,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:54:59,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:54:59,317 INFO L85 PathProgramCache]: Analyzing trace with hash -2066926825, now seen corresponding path program 1 times [2024-11-07 03:54:59,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:54:59,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414241652] [2024-11-07 03:54:59,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:54:59,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:54:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:54:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:54:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:54:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:54:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:54:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:54:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:54:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:54:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:54:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:54:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:54:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:54:59,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:54:59,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:54:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:54:59,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:54:59,508 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:54:59,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:54:59,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414241652] [2024-11-07 03:54:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414241652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:54:59,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:54:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:54:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084747529] [2024-11-07 03:54:59,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:54:59,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:54:59,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:54:59,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:54:59,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:54:59,511 INFO L87 Difference]: Start difference. First operand 457 states and 689 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:54:59,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:54:59,900 INFO L93 Difference]: Finished difference Result 1283 states and 1944 transitions. [2024-11-07 03:54:59,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:54:59,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-11-07 03:54:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:54:59,905 INFO L225 Difference]: With dead ends: 1283 [2024-11-07 03:54:59,906 INFO L226 Difference]: Without dead ends: 1055 [2024-11-07 03:54:59,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:54:59,911 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 291 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 03:54:59,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 406 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 03:54:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2024-11-07 03:55:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 904. [2024-11-07 03:55:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 699 states have (on average 1.4434907010014306) internal successors, (1009), 699 states have internal predecessors, (1009), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-07 03:55:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1369 transitions. [2024-11-07 03:55:00,054 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1369 transitions. Word has length 104 [2024-11-07 03:55:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:00,054 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1369 transitions. [2024-11-07 03:55:00,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:55:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1369 transitions. [2024-11-07 03:55:00,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 03:55:00,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:00,059 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:55:00,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 03:55:00,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:00,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:00,060 INFO L85 PathProgramCache]: Analyzing trace with hash -901066111, now seen corresponding path program 1 times [2024-11-07 03:55:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:00,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883212089] [2024-11-07 03:55:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:00,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:00,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:55:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:55:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:55:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:55:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:55:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:55:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:55:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:55:00,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:55:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:00,261 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:55:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:00,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883212089] [2024-11-07 03:55:00,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883212089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:00,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 03:55:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141376581] [2024-11-07 03:55:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:00,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 03:55:00,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 03:55:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:55:00,263 INFO L87 Difference]: Start difference. First operand 904 states and 1369 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:55:00,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:00,611 INFO L93 Difference]: Finished difference Result 1959 states and 2962 transitions. [2024-11-07 03:55:00,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 03:55:00,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 105 [2024-11-07 03:55:00,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:00,617 INFO L225 Difference]: With dead ends: 1959 [2024-11-07 03:55:00,617 INFO L226 Difference]: Without dead ends: 1058 [2024-11-07 03:55:00,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-07 03:55:00,620 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 287 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:00,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 407 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 03:55:00,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2024-11-07 03:55:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 1041. [2024-11-07 03:55:00,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 802 states have (on average 1.440149625935162) internal successors, (1155), 802 states have internal predecessors, (1155), 210 states have call successors, (210), 28 states have call predecessors, (210), 28 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-07 03:55:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1575 transitions. [2024-11-07 03:55:00,702 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1575 transitions. Word has length 105 [2024-11-07 03:55:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:00,702 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1575 transitions. [2024-11-07 03:55:00,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:55:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1575 transitions. [2024-11-07 03:55:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 03:55:00,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:00,704 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:55:00,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 03:55:00,705 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:00,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash -454145469, now seen corresponding path program 1 times [2024-11-07 03:55:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:00,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035635149] [2024-11-07 03:55:00,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:00,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:55:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:55:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:55:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:55:01,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:55:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:55:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:55:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:55:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:55:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 57 proven. 21 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2024-11-07 03:55:01,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035635149] [2024-11-07 03:55:01,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035635149] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 03:55:01,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346002762] [2024-11-07 03:55:01,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:01,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:55:01,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:55:01,507 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 03:55:01,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 03:55:01,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:01,608 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-07 03:55:01,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:55:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 287 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-07 03:55:02,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:55:02,949 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 30 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-07 03:55:02,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346002762] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:55:02,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 03:55:02,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 25 [2024-11-07 03:55:02,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247542913] [2024-11-07 03:55:02,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 03:55:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-07 03:55:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-07 03:55:02,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2024-11-07 03:55:02,952 INFO L87 Difference]: Start difference. First operand 1041 states and 1575 transitions. Second operand has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-07 03:55:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:04,074 INFO L93 Difference]: Finished difference Result 1903 states and 2788 transitions. [2024-11-07 03:55:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-07 03:55:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) Word has length 105 [2024-11-07 03:55:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:04,081 INFO L225 Difference]: With dead ends: 1903 [2024-11-07 03:55:04,082 INFO L226 Difference]: Without dead ends: 1140 [2024-11-07 03:55:04,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=619, Invalid=1361, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 03:55:04,084 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 424 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:04,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 364 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 03:55:04,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2024-11-07 03:55:04,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 465. [2024-11-07 03:55:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 350 states have (on average 1.3571428571428572) internal successors, (475), 350 states have internal predecessors, (475), 90 states have call successors, (90), 24 states have call predecessors, (90), 24 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 03:55:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 655 transitions. [2024-11-07 03:55:04,178 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 655 transitions. Word has length 105 [2024-11-07 03:55:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:04,178 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 655 transitions. [2024-11-07 03:55:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.28) internal successors, (82), 25 states have internal predecessors, (82), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-07 03:55:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 655 transitions. [2024-11-07 03:55:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-07 03:55:04,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:04,181 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:55:04,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 03:55:04,384 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 03:55:04,385 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:04,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1009226035, now seen corresponding path program 1 times [2024-11-07 03:55:04,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:04,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776931037] [2024-11-07 03:55:04,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:04,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:55:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:04,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:55:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:55:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:04,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:55:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:55:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 03:55:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:55:04,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 03:55:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:55:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:55:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776931037] [2024-11-07 03:55:04,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776931037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:04,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:04,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:55:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103797098] [2024-11-07 03:55:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:04,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:55:04,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:55:04,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:55:04,559 INFO L87 Difference]: Start difference. First operand 465 states and 655 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:55:04,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:04,798 INFO L93 Difference]: Finished difference Result 1196 states and 1707 transitions. [2024-11-07 03:55:04,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:55:04,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 105 [2024-11-07 03:55:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:04,803 INFO L225 Difference]: With dead ends: 1196 [2024-11-07 03:55:04,803 INFO L226 Difference]: Without dead ends: 963 [2024-11-07 03:55:04,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 03:55:04,804 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 170 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:04,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 352 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 03:55:04,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-07 03:55:04,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 839. [2024-11-07 03:55:04,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 839 states, 648 states have (on average 1.3796296296296295) internal successors, (894), 648 states have internal predecessors, (894), 150 states have call successors, (150), 40 states have call predecessors, (150), 40 states have return successors, (150), 150 states have call predecessors, (150), 150 states have call successors, (150) [2024-11-07 03:55:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 1194 transitions. [2024-11-07 03:55:04,887 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 1194 transitions. Word has length 105 [2024-11-07 03:55:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:04,887 INFO L471 AbstractCegarLoop]: Abstraction has 839 states and 1194 transitions. [2024-11-07 03:55:04,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:55:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 1194 transitions. [2024-11-07 03:55:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-07 03:55:04,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:04,891 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:55:04,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 03:55:04,892 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:04,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1503797495, now seen corresponding path program 1 times [2024-11-07 03:55:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031647596] [2024-11-07 03:55:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:04,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 03:55:04,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1505795813] [2024-11-07 03:55:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:04,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:55:04,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:55:04,941 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 03:55:04,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 03:55:05,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:55:05,046 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:55:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:55:05,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:55:05,136 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:55:05,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:55:05,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 03:55:05,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 03:55:05,345 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:55:05,399 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:55:05,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:55:05 BoogieIcfgContainer [2024-11-07 03:55:05,406 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:55:05,407 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:55:05,407 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:55:05,407 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:55:05,408 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:54:55" (3/4) ... [2024-11-07 03:55:05,410 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:55:05,410 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:55:05,411 INFO L158 Benchmark]: Toolchain (without parser) took 10726.52ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 91.6MB in the beginning and 174.6MB in the end (delta: -83.0MB). Peak memory consumption was 168.5MB. Max. memory is 16.1GB. [2024-11-07 03:55:05,411 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:55:05,411 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.51ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 77.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:55:05,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.47ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 74.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:55:05,412 INFO L158 Benchmark]: Boogie Preprocessor took 36.97ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 69.8MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:55:05,412 INFO L158 Benchmark]: RCFGBuilder took 483.52ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 48.6MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:55:05,412 INFO L158 Benchmark]: TraceAbstraction took 9886.29ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 48.0MB in the beginning and 174.7MB in the end (delta: -126.8MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2024-11-07 03:55:05,412 INFO L158 Benchmark]: Witness Printer took 3.63ms. Allocated memory is still 369.1MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 93.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:55:05,413 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.23ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.51ms. Allocated memory is still 117.4MB. Free memory was 91.5MB in the beginning and 77.8MB in the end (delta: 13.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.47ms. Allocated memory is still 117.4MB. Free memory was 77.8MB in the beginning and 74.5MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 36.97ms. Allocated memory is still 117.4MB. Free memory was 74.5MB in the beginning and 69.8MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 483.52ms. Allocated memory is still 117.4MB. Free memory was 69.8MB in the beginning and 48.6MB in the end (delta: 21.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 9886.29ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 48.0MB in the beginning and 174.7MB in the end (delta: -126.8MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. * Witness Printer took 3.63ms. Allocated memory is still 369.1MB. Free memory was 174.7MB in the beginning and 174.6MB in the end (delta: 93.8kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of bitwiseOr at line 78. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L110] last_1_var_1_10 = var_1_10 [L111] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L121] RET updateLastVariables() [L122] CALL updateVariables() [L85] var_1_3 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L86] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L87] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L87] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L88] var_1_5 = __VERIFIER_nondet_char() [L89] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L89] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L90] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L91] var_1_13 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L92] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L93] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L94] var_1_14 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L95] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L96] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L97] var_1_15 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L98] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L99] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L100] var_1_16 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L101] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L102] var_1_21 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L103] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L104] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L105] var_1_22 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L106] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L107] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L122] RET updateVariables() [L123] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L47] COND TRUE (var_1_5 * var_1_13) > last_1_var_1_10 [L48] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L50] COND FALSE !((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L55] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=119, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L66] COND FALSE !((var_1_17 <= var_1_17) || var_1_3) [L71] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L73] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L78] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L78] COND TRUE var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23) [L79] COND TRUE var_1_12 == var_1_12 [L80] var_1_10 = 0u VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L114-L115] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=0, var_1_12=2, var_1_13=-1, var_1_14=119, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=8, var_1_21=127, var_1_22=0, var_1_23=64, var_1_3=0, var_1_5=8, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1671 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1665 mSDsluCounter, 2767 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1722 mSDsCounter, 481 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1266 IncrementalHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 481 mSolverCounterUnsat, 1045 mSDtfsCounter, 1266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 538 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1041occurred in iteration=8, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1273 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 1354 NumberOfCodeBlocks, 1354 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1235 ConstructedInterpolants, 0 QuantifiedInterpolants, 4522 SizeOfPredicates, 7 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 4968/5040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 03:55:05,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.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 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:55:07,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:55:07,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 03:55:07,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:55:07,501 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:55:07,535 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:55:07,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:55:07,541 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:55:07,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:55:07,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:55:07,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:55:07,541 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:55:07,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:55:07,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:55:07,541 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:55:07,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:55:07,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:55:07,542 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:55:07,543 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:55:07,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:55:07,543 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:55:07,543 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:55:07,543 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:55:07,543 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:55:07,543 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:55:07,543 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:55:07,544 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:55:07,544 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:55:07,552 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 -> 3d47f2d590788b5b215b1242024ad3fa5a12acabdbb9cad16a442da1352e0490 [2024-11-07 03:55:07,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:55:07,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:55:07,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:55:07,822 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:55:07,822 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:55:07,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-11-07 03:55:09,123 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:55:09,379 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:55:09,380 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i [2024-11-07 03:55:09,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcea30c33/21fb77b6b13a4d38b25da0e99171dab1/FLAG6c83850af [2024-11-07 03:55:09,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcea30c33/21fb77b6b13a4d38b25da0e99171dab1 [2024-11-07 03:55:09,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:55:09,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:55:09,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:55:09,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:55:09,422 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:55:09,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a7e8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09, skipping insertion in model container [2024-11-07 03:55:09,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:55:09,573 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-11-07 03:55:09,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:55:09,644 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:55:09,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-3.i[918,931] [2024-11-07 03:55:09,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:55:09,704 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:55:09,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09 WrapperNode [2024-11-07 03:55:09,706 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:55:09,707 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:55:09,707 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:55:09,707 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:55:09,712 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,721 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,737 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2024-11-07 03:55:09,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:55:09,738 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:55:09,738 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:55:09,738 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:55:09,744 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,747 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,757 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 03:55:09,757 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,757 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,768 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,770 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:55:09,771 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:55:09,771 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:55:09,771 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:55:09,772 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (1/1) ... [2024-11-07 03:55:09,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:55:09,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:55:09,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 03:55:09,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 03:55:09,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:55:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:55:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:55:09,831 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:55:09,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:55:09,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:55:09,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:55:09,894 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:55:24,824 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:55:24,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:55:24,831 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:55:24,831 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:55:24,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:24 BoogieIcfgContainer [2024-11-07 03:55:24,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:55:24,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:55:24,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:55:24,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:55:24,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:55:09" (1/3) ... [2024-11-07 03:55:24,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1556cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:24, skipping insertion in model container [2024-11-07 03:55:24,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:09" (2/3) ... [2024-11-07 03:55:24,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1556cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:24, skipping insertion in model container [2024-11-07 03:55:24,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:24" (3/3) ... [2024-11-07 03:55:24,838 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-3.i [2024-11-07 03:55:24,848 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:55:24,849 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:55:24,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:55:24,890 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;@542c9386, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:55:24,890 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:55:24,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 40 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 03:55:24,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 03:55:24,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:24,901 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:55:24,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:24,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:24,904 INFO L85 PathProgramCache]: Analyzing trace with hash -359247469, now seen corresponding path program 1 times [2024-11-07 03:55:24,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:55:24,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126951158] [2024-11-07 03:55:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:24,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:55:24,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:55:24,915 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:55:24,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 03:55:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:25,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 03:55:25,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:55:25,908 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-07 03:55:25,909 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:55:25,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:55:25,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126951158] [2024-11-07 03:55:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126951158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:25,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:25,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:55:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287217263] [2024-11-07 03:55:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:25,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:55:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:55:25,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:55:25,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:55:25,928 INFO L87 Difference]: Start difference. First operand has 57 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 40 states have internal predecessors, (59), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:55:25,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:25,942 INFO L93 Difference]: Finished difference Result 107 states and 187 transitions. [2024-11-07 03:55:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:55:25,943 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-11-07 03:55:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:25,947 INFO L225 Difference]: With dead ends: 107 [2024-11-07 03:55:25,948 INFO L226 Difference]: Without dead ends: 53 [2024-11-07 03:55:25,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:55:25,951 INFO L432 NwaCegarLoop]: 81 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, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:25,952 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:55:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-07 03:55:25,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-07 03:55:25,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 36 states have internal predecessors, (51), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-07 03:55:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-11-07 03:55:25,979 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 99 [2024-11-07 03:55:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:25,979 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-11-07 03:55:25,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-07 03:55:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-11-07 03:55:25,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-07 03:55:25,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:25,985 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:55:26,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 03:55:26,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:55:26,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:26,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:26,188 INFO L85 PathProgramCache]: Analyzing trace with hash -2082774571, now seen corresponding path program 1 times [2024-11-07 03:55:26,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:55:26,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1406840352] [2024-11-07 03:55:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:26,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:55:26,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:55:26,194 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:55:26,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 03:55:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:27,104 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 03:55:27,108 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:55:32,195 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:55:32,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:55:32,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:55:32,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1406840352] [2024-11-07 03:55:32,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1406840352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:32,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:32,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:55:32,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769952485] [2024-11-07 03:55:32,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:32,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:55:32,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:55:32,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:55:32,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:55:32,203 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:55:37,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:41,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:44,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:45,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:48,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:51,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:55:56,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.30s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:56:00,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:56:00,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:56:00,724 INFO L93 Difference]: Finished difference Result 153 states and 237 transitions. [2024-11-07 03:56:00,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:56:00,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-07 03:56:00,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:56:00,728 INFO L225 Difference]: With dead ends: 153 [2024-11-07 03:56:00,728 INFO L226 Difference]: Without dead ends: 103 [2024-11-07 03:56:00,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:56:00,729 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 28.5s IncrementalHoareTripleChecker+Time [2024-11-07 03:56:00,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 147 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 4 Unknown, 0 Unchecked, 28.5s Time] [2024-11-07 03:56:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-07 03:56:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2024-11-07 03:56:00,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 03:56:00,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 155 transitions. [2024-11-07 03:56:00,740 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 155 transitions. Word has length 99 [2024-11-07 03:56:00,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:56:00,740 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 155 transitions. [2024-11-07 03:56:00,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:56:00,741 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 155 transitions. [2024-11-07 03:56:00,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-07 03:56:00,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:56:00,742 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:56:00,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 03:56:00,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:56:00,942 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:56:00,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:56:00,943 INFO L85 PathProgramCache]: Analyzing trace with hash 462721290, now seen corresponding path program 1 times [2024-11-07 03:56:00,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:56:00,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451390856] [2024-11-07 03:56:00,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:56:00,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:56:00,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:56:00,946 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:56:00,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 03:56:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:01,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 03:56:01,890 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:56:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:56:02,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:56:02,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:56:02,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451390856] [2024-11-07 03:56:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451390856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:56:02,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:56:02,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:56:02,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830138230] [2024-11-07 03:56:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:56:02,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:56:02,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:56:02,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:56:02,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:56:02,062 INFO L87 Difference]: Start difference. First operand 101 states and 155 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:56:06,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:56:10,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:56:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:56:10,791 INFO L93 Difference]: Finished difference Result 235 states and 362 transitions. [2024-11-07 03:56:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:56:10,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-07 03:56:10,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:56:10,794 INFO L225 Difference]: With dead ends: 235 [2024-11-07 03:56:10,794 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 03:56:10,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:56:10,795 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 26 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-07 03:56:10,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 146 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 2 Unknown, 0 Unchecked, 8.7s Time] [2024-11-07 03:56:10,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 03:56:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 111. [2024-11-07 03:56:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.3846153846153846) internal successors, (108), 78 states have internal predecessors, (108), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 03:56:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2024-11-07 03:56:10,826 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 100 [2024-11-07 03:56:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:56:10,827 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2024-11-07 03:56:10,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:56:10,827 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2024-11-07 03:56:10,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-07 03:56:10,828 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:56:10,828 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:56:10,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 03:56:11,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:56:11,034 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:56:11,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:56:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash 163399979, now seen corresponding path program 1 times [2024-11-07 03:56:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:56:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651324468] [2024-11-07 03:56:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:56:11,036 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 03:56:11,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:56:11,042 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 03:56:11,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 03:56:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:56:11,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-07 03:56:11,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:56:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-07 03:56:14,776 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:56:14,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:56:14,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651324468] [2024-11-07 03:56:14,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651324468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:56:14,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:56:14,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:56:14,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543988112] [2024-11-07 03:56:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:56:14,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:56:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:56:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:56:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:56:14,778 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-07 03:56:20,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:56:24,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:56:28,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:56:32,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []