./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.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', 'bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.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 bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:50:06,837 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:50:06,936 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:50:06,942 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:50:06,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:50:06,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:50:06,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:50:06,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:50:06,970 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:50:06,970 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:50:06,971 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:50:06,971 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:50:06,971 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:50:06,971 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:50:06,971 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:50:06,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:50:06,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:50:06,972 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:50:06,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:50:06,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:50:06,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:50:06,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:50:06,972 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:50:06,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:50:06,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:50:06,973 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:50:06,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:50:06,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:50:06,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:50:06,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:50:06,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:50:06,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:50:06,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:50:06,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:50:06,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:50:06,975 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 -> bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 [2024-11-07 05:50:07,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:50:07,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:50:07,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:50:07,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:50:07,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:50:07,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-11-07 05:50:08,608 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:50:08,861 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:50:08,862 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-11-07 05:50:08,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7296c7021/07f228d8f0fd48659f0afe33fbdefad6/FLAGe352d7ab2 [2024-11-07 05:50:08,883 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7296c7021/07f228d8f0fd48659f0afe33fbdefad6 [2024-11-07 05:50:08,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:50:08,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:50:08,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:50:08,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:50:08,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:50:08,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:50:08" (1/1) ... [2024-11-07 05:50:08,893 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b5626c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:08, skipping insertion in model container [2024-11-07 05:50:08,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:50:08" (1/1) ... [2024-11-07 05:50:08,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:50:09,050 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i[919,932] [2024-11-07 05:50:09,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:50:09,140 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:50:09,151 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i[919,932] [2024-11-07 05:50:09,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:50:09,203 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:50:09,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09 WrapperNode [2024-11-07 05:50:09,204 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:50:09,205 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:50:09,205 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:50:09,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:50:09,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,218 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,266 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-11-07 05:50:09,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:50:09,268 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:50:09,268 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:50:09,268 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:50:09,277 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,285 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,312 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 05:50:09,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,327 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,338 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:50:09,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:50:09,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:50:09,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:50:09,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (1/1) ... [2024-11-07 05:50:09,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:50:09,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:50:09,394 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 05:50:09,399 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 05:50:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:50:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:50:09,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:50:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:50:09,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:50:09,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:50:09,490 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:50:09,492 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:50:10,027 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-07 05:50:10,028 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:50:10,041 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:50:10,043 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:50:10,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:50:10 BoogieIcfgContainer [2024-11-07 05:50:10,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:50:10,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:50:10,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:50:10,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:50:10,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:50:08" (1/3) ... [2024-11-07 05:50:10,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b892a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:50:10, skipping insertion in model container [2024-11-07 05:50:10,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:09" (2/3) ... [2024-11-07 05:50:10,052 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b892a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:50:10, skipping insertion in model container [2024-11-07 05:50:10,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:50:10" (3/3) ... [2024-11-07 05:50:10,054 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-11-07 05:50:10,068 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:50:10,068 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:50:10,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:50:10,139 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;@78c75873, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:50:10,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:50:10,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:50:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 05:50:10,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:10,161 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:10,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:10,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:10,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1728460614, now seen corresponding path program 1 times [2024-11-07 05:50:10,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:10,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826392861] [2024-11-07 05:50:10,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:10,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:10,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:10,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:10,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:10,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826392861] [2024-11-07 05:50:10,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826392861] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:10,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:50:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858214836] [2024-11-07 05:50:10,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:50:10,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:10,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:50:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:50:10,677 INFO L87 Difference]: Start difference. First operand has 99 states, 74 states have (on average 1.4864864864864864) internal successors, (110), 75 states have internal predecessors, (110), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:50:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:10,709 INFO L93 Difference]: Finished difference Result 190 states and 322 transitions. [2024-11-07 05:50:10,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:50:10,713 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2024-11-07 05:50:10,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:10,719 INFO L225 Difference]: With dead ends: 190 [2024-11-07 05:50:10,719 INFO L226 Difference]: Without dead ends: 94 [2024-11-07 05:50:10,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 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 05:50:10,726 INFO L432 NwaCegarLoop]: 140 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, 140 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 05:50:10,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:50:10,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-07 05:50:10,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-07 05:50:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:50:10,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 140 transitions. [2024-11-07 05:50:10,780 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 140 transitions. Word has length 155 [2024-11-07 05:50:10,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:10,780 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 140 transitions. [2024-11-07 05:50:10,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:50:10,781 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 140 transitions. [2024-11-07 05:50:10,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 05:50:10,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:10,788 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:10,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:50:10,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:10,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1967987502, now seen corresponding path program 1 times [2024-11-07 05:50:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:10,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53275569] [2024-11-07 05:50:10,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:11,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:11,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:11,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,175 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:11,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:11,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53275569] [2024-11-07 05:50:11,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53275569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:11,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:11,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:50:11,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592102299] [2024-11-07 05:50:11,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:11,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:50:11,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:11,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:50:11,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:50:11,178 INFO L87 Difference]: Start difference. First operand 94 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:11,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:11,256 INFO L93 Difference]: Finished difference Result 238 states and 352 transitions. [2024-11-07 05:50:11,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:50:11,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-07 05:50:11,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:11,259 INFO L225 Difference]: With dead ends: 238 [2024-11-07 05:50:11,259 INFO L226 Difference]: Without dead ends: 147 [2024-11-07 05:50:11,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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 05:50:11,261 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 73 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:11,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 257 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:50:11,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-07 05:50:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-07 05:50:11,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 111 states have (on average 1.3513513513513513) internal successors, (150), 112 states have internal predecessors, (150), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 05:50:11,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 210 transitions. [2024-11-07 05:50:11,293 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 210 transitions. Word has length 155 [2024-11-07 05:50:11,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:11,294 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 210 transitions. [2024-11-07 05:50:11,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 210 transitions. [2024-11-07 05:50:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 05:50:11,300 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:11,300 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:11,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:50:11,301 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:11,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:11,301 INFO L85 PathProgramCache]: Analyzing trace with hash 279043760, now seen corresponding path program 1 times [2024-11-07 05:50:11,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:11,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866462962] [2024-11-07 05:50:11,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:11,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:11,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:12,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:12,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:12,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:12,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:12,084 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:12,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:12,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866462962] [2024-11-07 05:50:12,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866462962] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:12,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:12,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:50:12,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665030653] [2024-11-07 05:50:12,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:12,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:50:12,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:12,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:50:12,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:12,095 INFO L87 Difference]: Start difference. First operand 144 states and 210 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:12,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:12,607 INFO L93 Difference]: Finished difference Result 463 states and 663 transitions. [2024-11-07 05:50:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:50:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-07 05:50:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:12,615 INFO L225 Difference]: With dead ends: 463 [2024-11-07 05:50:12,615 INFO L226 Difference]: Without dead ends: 322 [2024-11-07 05:50:12,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:12,617 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 242 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:12,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 351 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:50:12,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-07 05:50:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 255. [2024-11-07 05:50:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 201 states have (on average 1.328358208955224) internal successors, (267), 204 states have internal predecessors, (267), 48 states have call successors, (48), 5 states have call predecessors, (48), 5 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 05:50:12,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 363 transitions. [2024-11-07 05:50:12,678 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 363 transitions. Word has length 155 [2024-11-07 05:50:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:12,678 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 363 transitions. [2024-11-07 05:50:12,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 363 transitions. [2024-11-07 05:50:12,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-07 05:50:12,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:12,682 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:12,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:50:12,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:12,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1000819918, now seen corresponding path program 1 times [2024-11-07 05:50:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:12,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754158265] [2024-11-07 05:50:12,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:12,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:13,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:13,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:13,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:13,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:13,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:13,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:13,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:13,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:13,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:13,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:13,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:13,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:13,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:13,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:13,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754158265] [2024-11-07 05:50:13,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754158265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:13,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:13,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:50:13,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878624369] [2024-11-07 05:50:13,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:13,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:50:13,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:13,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:50:13,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:50:13,409 INFO L87 Difference]: Start difference. First operand 255 states and 363 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:13,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:13,541 INFO L93 Difference]: Finished difference Result 570 states and 810 transitions. [2024-11-07 05:50:13,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:50:13,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 155 [2024-11-07 05:50:13,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:13,545 INFO L225 Difference]: With dead ends: 570 [2024-11-07 05:50:13,546 INFO L226 Difference]: Without dead ends: 318 [2024-11-07 05:50:13,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:13,547 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 116 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:13,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 453 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:50:13,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-07 05:50:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 289. [2024-11-07 05:50:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 222 states have internal predecessors, (280), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-07 05:50:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 404 transitions. [2024-11-07 05:50:13,607 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 404 transitions. Word has length 155 [2024-11-07 05:50:13,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:13,608 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 404 transitions. [2024-11-07 05:50:13,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:13,608 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 404 transitions. [2024-11-07 05:50:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-07 05:50:13,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:13,610 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:13,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:50:13,611 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:13,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash -2095389213, now seen corresponding path program 1 times [2024-11-07 05:50:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:13,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126980758] [2024-11-07 05:50:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:13,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:13,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:13,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:13,952 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:13,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:13,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126980758] [2024-11-07 05:50:13,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126980758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:13,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:13,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:50:13,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676676117] [2024-11-07 05:50:13,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:13,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:50:13,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:13,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:50:13,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:13,955 INFO L87 Difference]: Start difference. First operand 289 states and 404 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:14,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:14,307 INFO L93 Difference]: Finished difference Result 760 states and 1066 transitions. [2024-11-07 05:50:14,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:50:14,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 157 [2024-11-07 05:50:14,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:14,314 INFO L225 Difference]: With dead ends: 760 [2024-11-07 05:50:14,315 INFO L226 Difference]: Without dead ends: 464 [2024-11-07 05:50:14,316 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:14,316 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 140 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:14,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 646 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:50:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2024-11-07 05:50:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 293. [2024-11-07 05:50:14,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 222 states have (on average 1.2702702702702702) internal successors, (282), 226 states have internal predecessors, (282), 62 states have call successors, (62), 8 states have call predecessors, (62), 8 states have return successors, (62), 58 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-07 05:50:14,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 406 transitions. [2024-11-07 05:50:14,390 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 406 transitions. Word has length 157 [2024-11-07 05:50:14,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:14,391 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 406 transitions. [2024-11-07 05:50:14,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:14,391 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 406 transitions. [2024-11-07 05:50:14,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-07 05:50:14,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:14,393 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:14,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:50:14,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:14,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:14,394 INFO L85 PathProgramCache]: Analyzing trace with hash -83443025, now seen corresponding path program 1 times [2024-11-07 05:50:14,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:14,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101538537] [2024-11-07 05:50:14,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:14,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:14,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:14,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:14,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:14,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:14,948 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:14,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:14,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101538537] [2024-11-07 05:50:14,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101538537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:14,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:14,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:50:14,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403146513] [2024-11-07 05:50:14,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:14,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:50:14,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:14,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:50:14,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:14,951 INFO L87 Difference]: Start difference. First operand 293 states and 406 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:15,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:15,279 INFO L93 Difference]: Finished difference Result 729 states and 1010 transitions. [2024-11-07 05:50:15,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:50:15,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 158 [2024-11-07 05:50:15,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:15,283 INFO L225 Difference]: With dead ends: 729 [2024-11-07 05:50:15,283 INFO L226 Difference]: Without dead ends: 473 [2024-11-07 05:50:15,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:15,284 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 106 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:15,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 451 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:50:15,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-07 05:50:15,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 314. [2024-11-07 05:50:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 234 states have (on average 1.2564102564102564) internal successors, (294), 237 states have internal predecessors, (294), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 05:50:15,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 434 transitions. [2024-11-07 05:50:15,331 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 434 transitions. Word has length 158 [2024-11-07 05:50:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:15,331 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 434 transitions. [2024-11-07 05:50:15,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 434 transitions. [2024-11-07 05:50:15,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 05:50:15,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:15,333 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:15,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:50:15,334 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:15,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:15,334 INFO L85 PathProgramCache]: Analyzing trace with hash 541934139, now seen corresponding path program 1 times [2024-11-07 05:50:15,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:15,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105804611] [2024-11-07 05:50:15,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:15,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:15,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:15,851 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:15,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105804611] [2024-11-07 05:50:15,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105804611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:15,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:15,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:50:15,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449729196] [2024-11-07 05:50:15,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:15,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:50:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:15,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:50:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:50:15,853 INFO L87 Difference]: Start difference. First operand 314 states and 434 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:16,782 INFO L93 Difference]: Finished difference Result 1029 states and 1424 transitions. [2024-11-07 05:50:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:50:16,783 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-07 05:50:16,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:16,788 INFO L225 Difference]: With dead ends: 1029 [2024-11-07 05:50:16,788 INFO L226 Difference]: Without dead ends: 729 [2024-11-07 05:50:16,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:50:16,790 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 202 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:16,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 904 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:50:16,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-11-07 05:50:16,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 367. [2024-11-07 05:50:16,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 287 states have (on average 1.2752613240418118) internal successors, (366), 290 states have internal predecessors, (366), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 05:50:16,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 506 transitions. [2024-11-07 05:50:16,872 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 506 transitions. Word has length 159 [2024-11-07 05:50:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:16,873 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 506 transitions. [2024-11-07 05:50:16,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 506 transitions. [2024-11-07 05:50:16,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 05:50:16,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:16,875 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:16,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 05:50:16,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:16,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:16,876 INFO L85 PathProgramCache]: Analyzing trace with hash -275714311, now seen corresponding path program 1 times [2024-11-07 05:50:16,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:16,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998158325] [2024-11-07 05:50:16,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:16,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:17,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:17,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:17,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:17,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:17,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:17,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:17,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:17,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998158325] [2024-11-07 05:50:17,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998158325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:17,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:50:17,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280474173] [2024-11-07 05:50:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:50:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:17,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:50:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:17,333 INFO L87 Difference]: Start difference. First operand 367 states and 506 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:17,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:17,634 INFO L93 Difference]: Finished difference Result 888 states and 1225 transitions. [2024-11-07 05:50:17,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:50:17,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-07 05:50:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:17,638 INFO L225 Difference]: With dead ends: 888 [2024-11-07 05:50:17,638 INFO L226 Difference]: Without dead ends: 579 [2024-11-07 05:50:17,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:17,640 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 104 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:17,640 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 452 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:50:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2024-11-07 05:50:17,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 368. [2024-11-07 05:50:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 288 states have (on average 1.2743055555555556) internal successors, (367), 291 states have internal predecessors, (367), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 05:50:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 507 transitions. [2024-11-07 05:50:17,717 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 507 transitions. Word has length 159 [2024-11-07 05:50:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 507 transitions. [2024-11-07 05:50:17,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 507 transitions. [2024-11-07 05:50:17,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 05:50:17,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:17,719 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:17,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 05:50:17,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:17,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1110489083, now seen corresponding path program 1 times [2024-11-07 05:50:17,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:17,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762132943] [2024-11-07 05:50:17,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:18,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:18,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:18,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:18,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:18,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-07 05:50:18,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:18,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762132943] [2024-11-07 05:50:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762132943] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:50:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311698161] [2024-11-07 05:50:18,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:18,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:50:18,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:50:18,099 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 05:50:18,102 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 05:50:18,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:18,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-07 05:50:18,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:50:18,588 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-11-07 05:50:18,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:50:18,875 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-07 05:50:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311698161] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:50:18,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:50:18,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-07 05:50:18,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660681131] [2024-11-07 05:50:18,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:50:18,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 05:50:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:18,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 05:50:18,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-07 05:50:18,878 INFO L87 Difference]: Start difference. First operand 368 states and 507 transitions. Second operand has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-07 05:50:19,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:19,813 INFO L93 Difference]: Finished difference Result 804 states and 1101 transitions. [2024-11-07 05:50:19,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-07 05:50:19,814 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 159 [2024-11-07 05:50:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:19,817 INFO L225 Difference]: With dead ends: 804 [2024-11-07 05:50:19,818 INFO L226 Difference]: Without dead ends: 475 [2024-11-07 05:50:19,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2024-11-07 05:50:19,820 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 208 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:19,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 654 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:50:19,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-07 05:50:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 346. [2024-11-07 05:50:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 264 states have (on average 1.2613636363636365) internal successors, (333), 267 states have internal predecessors, (333), 70 states have call successors, (70), 11 states have call predecessors, (70), 11 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 05:50:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 473 transitions. [2024-11-07 05:50:19,885 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 473 transitions. Word has length 159 [2024-11-07 05:50:19,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:19,886 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 473 transitions. [2024-11-07 05:50:19,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 6.733333333333333) internal successors, (101), 15 states have internal predecessors, (101), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-11-07 05:50:19,887 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 473 transitions. [2024-11-07 05:50:19,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:50:19,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:19,888 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:19,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 05:50:20,092 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 05:50:20,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:20,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:20,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1341560912, now seen corresponding path program 1 times [2024-11-07 05:50:20,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:20,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835369203] [2024-11-07 05:50:20,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:20,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:20,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:20,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:20,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:20,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:20,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:20,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:20,460 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:20,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835369203] [2024-11-07 05:50:20,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835369203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:50:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064397379] [2024-11-07 05:50:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:20,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:50:20,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:50:20,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:50:20,462 INFO L87 Difference]: Start difference. First operand 346 states and 473 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:50:21,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:21,256 INFO L93 Difference]: Finished difference Result 1146 states and 1569 transitions. [2024-11-07 05:50:21,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:50:21,257 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 160 [2024-11-07 05:50:21,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:21,262 INFO L225 Difference]: With dead ends: 1146 [2024-11-07 05:50:21,262 INFO L226 Difference]: Without dead ends: 863 [2024-11-07 05:50:21,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:50:21,264 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 450 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:21,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 557 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 05:50:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-07 05:50:21,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 553. [2024-11-07 05:50:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 447 states have (on average 1.2885906040268456) internal successors, (576), 452 states have internal predecessors, (576), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 05:50:21,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 756 transitions. [2024-11-07 05:50:21,354 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 756 transitions. Word has length 160 [2024-11-07 05:50:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:21,354 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 756 transitions. [2024-11-07 05:50:21,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:50:21,355 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 756 transitions. [2024-11-07 05:50:21,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:50:21,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:21,358 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:21,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 05:50:21,359 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:21,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:21,359 INFO L85 PathProgramCache]: Analyzing trace with hash -347382830, now seen corresponding path program 1 times [2024-11-07 05:50:21,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:21,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822696593] [2024-11-07 05:50:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:21,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:21,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:21,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:21,612 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:21,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:21,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822696593] [2024-11-07 05:50:21,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822696593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:21,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:21,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:50:21,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236634705] [2024-11-07 05:50:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:21,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:50:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:21,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:50:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:21,614 INFO L87 Difference]: Start difference. First operand 553 states and 756 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:22,026 INFO L93 Difference]: Finished difference Result 1171 states and 1600 transitions. [2024-11-07 05:50:22,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:50:22,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 05:50:22,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:22,032 INFO L225 Difference]: With dead ends: 1171 [2024-11-07 05:50:22,032 INFO L226 Difference]: Without dead ends: 681 [2024-11-07 05:50:22,033 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:22,034 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 169 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:22,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 485 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:50:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-11-07 05:50:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 508. [2024-11-07 05:50:22,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 402 states have (on average 1.2761194029850746) internal successors, (513), 407 states have internal predecessors, (513), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 85 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-07 05:50:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 693 transitions. [2024-11-07 05:50:22,124 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 693 transitions. Word has length 160 [2024-11-07 05:50:22,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:22,125 INFO L471 AbstractCegarLoop]: Abstraction has 508 states and 693 transitions. [2024-11-07 05:50:22,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 693 transitions. [2024-11-07 05:50:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:50:22,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:22,127 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:22,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 05:50:22,128 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:22,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:22,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1102307696, now seen corresponding path program 1 times [2024-11-07 05:50:22,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:22,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704637510] [2024-11-07 05:50:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:22,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:22,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:22,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:22,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:22,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:22,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:22,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,565 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-07 05:50:22,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:22,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704637510] [2024-11-07 05:50:22,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704637510] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:50:22,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51848251] [2024-11-07 05:50:22,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:22,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:50:22,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:50:22,568 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 05:50:22,570 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 05:50:22,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:22,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 05:50:22,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:50:23,214 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 562 proven. 54 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2024-11-07 05:50:23,215 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:50:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 66 proven. 57 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-11-07 05:50:23,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51848251] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:50:23,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:50:23,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 27 [2024-11-07 05:50:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573200658] [2024-11-07 05:50:23,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:50:23,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-07 05:50:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-07 05:50:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2024-11-07 05:50:23,752 INFO L87 Difference]: Start difference. First operand 508 states and 693 transitions. Second operand has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2024-11-07 05:50:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:26,818 INFO L93 Difference]: Finished difference Result 1642 states and 2216 transitions. [2024-11-07 05:50:26,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-07 05:50:26,820 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) Word has length 160 [2024-11-07 05:50:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:26,828 INFO L225 Difference]: With dead ends: 1642 [2024-11-07 05:50:26,828 INFO L226 Difference]: Without dead ends: 1041 [2024-11-07 05:50:26,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2909 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1771, Invalid=7349, Unknown=0, NotChecked=0, Total=9120 [2024-11-07 05:50:26,834 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 1873 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 848 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1875 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 848 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:26,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1875 Valid, 1112 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [848 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 05:50:26,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-07 05:50:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 382. [2024-11-07 05:50:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 317 states have (on average 1.2839116719242902) internal successors, (407), 318 states have internal predecessors, (407), 52 states have call successors, (52), 12 states have call predecessors, (52), 12 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 05:50:26,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 511 transitions. [2024-11-07 05:50:26,901 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 511 transitions. Word has length 160 [2024-11-07 05:50:26,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:26,901 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 511 transitions. [2024-11-07 05:50:26,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.111111111111111) internal successors, (138), 27 states have internal predecessors, (138), 6 states have call successors, (44), 3 states have call predecessors, (44), 7 states have return successors, (46), 6 states have call predecessors, (46), 6 states have call successors, (46) [2024-11-07 05:50:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 511 transitions. [2024-11-07 05:50:26,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:50:26,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:26,905 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:26,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-07 05:50:27,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:50:27,106 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:27,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:27,106 INFO L85 PathProgramCache]: Analyzing trace with hash -912171550, now seen corresponding path program 1 times [2024-11-07 05:50:27,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:27,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501009407] [2024-11-07 05:50:27,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:27,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:27,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:27,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:27,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:27,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:27,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:27,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501009407] [2024-11-07 05:50:27,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501009407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:27,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:27,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:50:27,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718070844] [2024-11-07 05:50:27,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:27,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:50:27,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:27,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:50:27,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:27,619 INFO L87 Difference]: Start difference. First operand 382 states and 511 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:28,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:28,786 INFO L93 Difference]: Finished difference Result 1138 states and 1517 transitions. [2024-11-07 05:50:28,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:50:28,787 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-07 05:50:28,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:28,792 INFO L225 Difference]: With dead ends: 1138 [2024-11-07 05:50:28,792 INFO L226 Difference]: Without dead ends: 795 [2024-11-07 05:50:28,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:50:28,794 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 398 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:28,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 724 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 05:50:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2024-11-07 05:50:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 412. [2024-11-07 05:50:28,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 347 states have (on average 1.276657060518732) internal successors, (443), 348 states have internal predecessors, (443), 52 states have call successors, (52), 12 states have call predecessors, (52), 12 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 05:50:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 547 transitions. [2024-11-07 05:50:28,861 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 547 transitions. Word has length 161 [2024-11-07 05:50:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:28,863 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 547 transitions. [2024-11-07 05:50:28,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 547 transitions. [2024-11-07 05:50:28,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:50:28,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:28,866 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:28,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 05:50:28,867 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:28,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:28,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1729820000, now seen corresponding path program 1 times [2024-11-07 05:50:28,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:28,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995337186] [2024-11-07 05:50:28,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:28,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:50:29,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:50:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:50:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:50:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:50:29,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:50:29,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:50:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:50:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:50:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:50:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:50:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:50:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:50:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:50:29,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:50:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:50:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:50:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 05:50:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 05:50:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:50:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:50:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:50:29,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:50:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995337186] [2024-11-07 05:50:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995337186] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:29,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:29,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:50:29,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278650741] [2024-11-07 05:50:29,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:29,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:50:29,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:50:29,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:50:29,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:50:29,357 INFO L87 Difference]: Start difference. First operand 412 states and 547 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:30,872 INFO L93 Difference]: Finished difference Result 1002 states and 1337 transitions. [2024-11-07 05:50:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:50:30,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-07 05:50:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:30,877 INFO L225 Difference]: With dead ends: 1002 [2024-11-07 05:50:30,877 INFO L226 Difference]: Without dead ends: 657 [2024-11-07 05:50:30,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:50:30,879 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 370 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:30,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 717 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 05:50:30,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-11-07 05:50:30,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 442. [2024-11-07 05:50:30,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 377 states have (on average 1.2652519893899203) internal successors, (477), 378 states have internal predecessors, (477), 52 states have call successors, (52), 12 states have call predecessors, (52), 12 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 05:50:30,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 581 transitions. [2024-11-07 05:50:30,940 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 581 transitions. Word has length 161 [2024-11-07 05:50:30,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:30,941 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 581 transitions. [2024-11-07 05:50:30,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:30,941 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 581 transitions. [2024-11-07 05:50:30,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:50:30,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:30,944 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:30,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 05:50:30,944 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:30,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:30,945 INFO L85 PathProgramCache]: Analyzing trace with hash -693316832, now seen corresponding path program 1 times [2024-11-07 05:50:30,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:50:30,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488663217] [2024-11-07 05:50:30,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:30,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:50:31,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:50:31,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [409125517] [2024-11-07 05:50:31,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:31,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:50:31,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:50:31,031 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 05:50:31,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 05:50:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:50:31,337 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:50:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:50:31,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:50:31,531 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:50:31,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:50:31,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 05:50:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:50:31,737 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:50:31,844 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:50:31,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:50:31 BoogieIcfgContainer [2024-11-07 05:50:31,847 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:50:31,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:50:31,848 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:50:31,848 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:50:31,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:50:10" (3/4) ... [2024-11-07 05:50:31,851 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:50:31,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:50:31,852 INFO L158 Benchmark]: Toolchain (without parser) took 22965.99ms. Allocated memory was 100.7MB in the beginning and 352.3MB in the end (delta: 251.7MB). Free memory was 76.9MB in the beginning and 295.2MB in the end (delta: -218.3MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2024-11-07 05:50:31,853 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 82.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:50:31,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.03ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:50:31,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.35ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 56.3MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:50:31,854 INFO L158 Benchmark]: Boogie Preprocessor took 85.13ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 48.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:50:31,855 INFO L158 Benchmark]: RCFGBuilder took 690.35ms. Allocated memory is still 100.7MB. Free memory was 48.9MB in the beginning and 56.1MB in the end (delta: -7.2MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. [2024-11-07 05:50:31,855 INFO L158 Benchmark]: TraceAbstraction took 21801.25ms. Allocated memory was 100.7MB in the beginning and 352.3MB in the end (delta: 251.7MB). Free memory was 55.7MB in the beginning and 295.7MB in the end (delta: -240.1MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. [2024-11-07 05:50:31,855 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 352.3MB. Free memory was 295.3MB in the beginning and 295.2MB in the end (delta: 58.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:50:31,856 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.45ms. Allocated memory is still 83.9MB. Free memory was 48.1MB in the beginning and 48.0MB in the end (delta: 82.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.03ms. Allocated memory is still 100.7MB. Free memory was 76.8MB in the beginning and 61.1MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.35ms. Allocated memory is still 100.7MB. Free memory was 61.1MB in the beginning and 56.3MB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 85.13ms. Allocated memory is still 100.7MB. Free memory was 56.3MB in the beginning and 48.9MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 690.35ms. Allocated memory is still 100.7MB. Free memory was 48.9MB in the beginning and 56.1MB in the end (delta: -7.2MB). Peak memory consumption was 22.0MB. Max. memory is 16.1GB. * TraceAbstraction took 21801.25ms. Allocated memory was 100.7MB in the beginning and 352.3MB in the end (delta: 251.7MB). Free memory was 55.7MB in the beginning and 295.7MB in the end (delta: -240.1MB). Peak memory consumption was 191.0MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 352.3MB. Free memory was 295.3MB in the beginning and 295.2MB in the end (delta: 58.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 111, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] float var_1_28 = 3.5; [L44] signed short int var_1_29 = -8; [L45] signed char var_1_31 = -32; [L46] signed char var_1_32 = 2; [L47] signed long int var_1_34 = -4; [L48] double var_1_38 = 0.5; [L49] unsigned long int last_1_var_1_1 = 64; [L50] unsigned char last_1_var_1_11 = 50; VAL [isInitial=0, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_1 = var_1_1 [L175] last_1_var_1_11 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=1, var_1_8=0, var_1_9=0] [L142] var_1_7 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_8=0, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L145] var_1_9 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L146] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L148] var_1_10 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L151] var_1_12 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L154] var_1_13 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L54] signed long int stepLocal_1 = last_1_var_1_11; [L55] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L56] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L57] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L61] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L62] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L62] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L63] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L74] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L76] COND FALSE !(! (var_1_11 >= var_1_11)) [L83] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L85] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L90] COND FALSE !(\read(var_1_10)) [L93] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L95] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L96] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L99] COND FALSE !((~ (var_1_5 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L102] COND TRUE var_1_12 > var_1_16 [L103] var_1_28 = ((((4.2f) < (1.25f)) ? (4.2f) : (1.25f))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L105] COND TRUE (~ (5 + var_1_16)) >= 10000u [L106] var_1_29 = (((((var_1_13 + var_1_12)) > (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) ? ((var_1_13 + var_1_12)) : (((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L110] var_1_31 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] EXPR var_1_1 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] EXPR ((var_1_13) < ((var_1_1 | -5))) ? (var_1_13) : ((var_1_1 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L111] COND TRUE var_1_11 <= ((((var_1_13) < ((var_1_1 | -5))) ? (var_1_13) : ((var_1_1 | -5)))) [L112] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L116] COND TRUE ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L117] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L133] var_1_38 = var_1_19 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L178-L179] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_19=2, var_1_1=14, var_1_24=11/2, var_1_25=-16, var_1_28=21/5, var_1_29=28, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225470, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 15, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4474 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4451 mSDsluCounter, 7903 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5705 mSDsCounter, 1505 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4694 IncrementalHoareTripleChecker+Invalid, 6199 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1505 mSolverCounterUnsat, 2198 mSDtfsCounter, 4694 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1502 GetRequests, 1312 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3057 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=553occurred in iteration=10, InterpolantAutomatonStates: 160, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 2871 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 2855 NumberOfCodeBlocks, 2855 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2834 ConstructedInterpolants, 0 QuantifiedInterpolants, 8915 SizeOfPredicates, 12 NumberOfNonLiveVariables, 740 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 16398/16632 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 05:50:31,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.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 bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:50:34,148 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:50:34,204 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:50:34,209 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:50:34,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:50:34,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:50:34,260 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:50:34,260 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:50:34,261 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:50:34,261 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:50:34,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:50:34,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:50:34,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:50:34,261 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:50:34,261 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:50:34,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:50:34,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:50:34,262 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:50:34,262 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:50:34,262 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:50:34,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:50:34,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:50:34,268 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:50:34,268 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:50:34,268 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:50:34,268 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:50:34,269 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:50:34,269 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:50:34,269 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:50:34,270 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:50:34,270 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:50:34,270 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:50:34,270 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:50:34,270 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:50:34,270 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 -> bd156d4b261f7974faf7f6b78b2668e560141098ddc5f2a0a7e1c7933cffbab8 [2024-11-07 05:50:34,572 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:50:34,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:50:34,585 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:50:34,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:50:34,587 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:50:34,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-11-07 05:50:35,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:50:36,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:50:36,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-11-07 05:50:36,277 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da2fe9f14/d7457d07c4c44e2bb832cb7927fa7abf/FLAG3712f2fc5 [2024-11-07 05:50:36,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/da2fe9f14/d7457d07c4c44e2bb832cb7927fa7abf [2024-11-07 05:50:36,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:50:36,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:50:36,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:50:36,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:50:36,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:50:36,313 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5481328d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36, skipping insertion in model container [2024-11-07 05:50:36,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:50:36,485 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i[919,932] [2024-11-07 05:50:36,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:50:36,595 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:50:36,608 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i[919,932] [2024-11-07 05:50:36,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:50:36,686 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:50:36,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36 WrapperNode [2024-11-07 05:50:36,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:50:36,689 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:50:36,689 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:50:36,689 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:50:36,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,716 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,758 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-07 05:50:36,759 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:50:36,760 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:50:36,760 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:50:36,760 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:50:36,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,777 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,801 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 05:50:36,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,838 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,845 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:50:36,849 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:50:36,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:50:36,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:50:36,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (1/1) ... [2024-11-07 05:50:36,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:50:36,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:50:36,894 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 05:50:36,897 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 05:50:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:50:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:50:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:50:36,925 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:50:36,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:50:36,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:50:37,028 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:50:37,030 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:50:40,368 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 05:50:40,369 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:50:40,384 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:50:40,386 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:50:40,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:50:40 BoogieIcfgContainer [2024-11-07 05:50:40,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:50:40,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:50:40,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:50:40,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:50:40,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:50:36" (1/3) ... [2024-11-07 05:50:40,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4dc041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:50:40, skipping insertion in model container [2024-11-07 05:50:40,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:50:36" (2/3) ... [2024-11-07 05:50:40,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e4dc041 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:50:40, skipping insertion in model container [2024-11-07 05:50:40,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:50:40" (3/3) ... [2024-11-07 05:50:40,398 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-74.i [2024-11-07 05:50:40,413 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:50:40,414 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:50:40,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:50:40,497 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;@2dfc177a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:50:40,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:50:40,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:50:40,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 05:50:40,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:40,519 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:40,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:40,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2054432455, now seen corresponding path program 1 times [2024-11-07 05:50:40,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:50:40,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [877236898] [2024-11-07 05:50:40,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:40,540 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 05:50:40,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:50:40,546 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 05:50:40,547 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 05:50:40,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:40,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:50:40,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:50:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2024-11-07 05:50:41,046 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:50:41,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:50:41,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [877236898] [2024-11-07 05:50:41,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [877236898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:41,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:41,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:50:41,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237459234] [2024-11-07 05:50:41,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:41,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:50:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:50:41,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:50:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:50:41,079 INFO L87 Difference]: Start difference. First operand has 81 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:50:41,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:41,108 INFO L93 Difference]: Finished difference Result 154 states and 268 transitions. [2024-11-07 05:50:41,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:50:41,111 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 149 [2024-11-07 05:50:41,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:41,116 INFO L225 Difference]: With dead ends: 154 [2024-11-07 05:50:41,117 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 05:50:41,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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 05:50:41,122 INFO L432 NwaCegarLoop]: 115 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, 115 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 05:50:41,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:50:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 05:50:41,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-07 05:50:41,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:50:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 115 transitions. [2024-11-07 05:50:41,168 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 115 transitions. Word has length 149 [2024-11-07 05:50:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:41,168 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 115 transitions. [2024-11-07 05:50:41,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:50:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 115 transitions. [2024-11-07 05:50:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-07 05:50:41,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:41,172 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:41,187 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 05:50:41,373 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 05:50:41,373 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:41,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:41,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1726602631, now seen corresponding path program 1 times [2024-11-07 05:50:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:50:41,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538539081] [2024-11-07 05:50:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:41,375 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 05:50:41,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:50:41,378 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 05:50:41,379 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 05:50:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:41,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:50:41,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:50:44,047 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:44,048 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:50:44,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:50:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538539081] [2024-11-07 05:50:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [538539081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:50:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179905134] [2024-11-07 05:50:44,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:44,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:50:44,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:50:44,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:50:44,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:44,052 INFO L87 Difference]: Start difference. First operand 76 states and 115 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:46,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:50:50,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.36s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:50:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:50,373 INFO L93 Difference]: Finished difference Result 223 states and 340 transitions. [2024-11-07 05:50:50,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:50:50,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2024-11-07 05:50:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:50,399 INFO L225 Difference]: With dead ends: 223 [2024-11-07 05:50:50,399 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 05:50:50,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:50,401 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 76 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:50,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 367 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2024-11-07 05:50:50,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 05:50:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 119. [2024-11-07 05:50:50,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 72 states have internal predecessors, (91), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 05:50:50,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 179 transitions. [2024-11-07 05:50:50,440 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 179 transitions. Word has length 149 [2024-11-07 05:50:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:50,441 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 179 transitions. [2024-11-07 05:50:50,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 179 transitions. [2024-11-07 05:50:50,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 05:50:50,447 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:50,447 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:50,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 05:50:50,647 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 05:50:50,648 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:50,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 118877521, now seen corresponding path program 1 times [2024-11-07 05:50:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:50:50,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904768776] [2024-11-07 05:50:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:50,649 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 05:50:50,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:50:50,653 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 05:50:50,654 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 05:50:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:50,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:50:51,000 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:50:53,171 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:50:53,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:50:53,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:50:53,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904768776] [2024-11-07 05:50:53,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904768776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:50:53,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:50:53,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:50:53,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736848798] [2024-11-07 05:50:53,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:50:53,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:50:53,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:50:53,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:50:53,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:50:53,178 INFO L87 Difference]: Start difference. First operand 119 states and 179 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:56,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:50:58,425 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:50:58,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:50:58,426 INFO L93 Difference]: Finished difference Result 223 states and 339 transitions. [2024-11-07 05:50:58,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:50:58,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-11-07 05:50:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:50:58,452 INFO L225 Difference]: With dead ends: 223 [2024-11-07 05:50:58,452 INFO L226 Difference]: Without dead ends: 150 [2024-11-07 05:50:58,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:50:58,454 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 74 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:50:58,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 368 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-07 05:50:58,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-07 05:50:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 120. [2024-11-07 05:50:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 73 states have (on average 1.2602739726027397) internal successors, (92), 73 states have internal predecessors, (92), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 05:50:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2024-11-07 05:50:58,483 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 180 transitions. Word has length 150 [2024-11-07 05:50:58,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:50:58,484 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 180 transitions. [2024-11-07 05:50:58,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:50:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 180 transitions. [2024-11-07 05:50:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 05:50:58,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:50:58,490 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:50:58,509 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 05:50:58,690 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 05:50:58,691 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:50:58,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:50:58,691 INFO L85 PathProgramCache]: Analyzing trace with hash -698770929, now seen corresponding path program 1 times [2024-11-07 05:50:58,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:50:58,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554489206] [2024-11-07 05:50:58,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:50:58,692 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 05:50:58,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:50:58,698 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 05:50:58,699 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 05:50:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:50:59,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 05:50:59,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:51:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-11-07 05:51:00,300 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:51:01,426 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-11-07 05:51:01,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:51:01,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554489206] [2024-11-07 05:51:01,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554489206] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:51:01,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:51:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-07 05:51:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945228444] [2024-11-07 05:51:01,428 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:51:01,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 05:51:01,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:51:01,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 05:51:01,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 05:51:01,432 INFO L87 Difference]: Start difference. First operand 120 states and 180 transitions. Second operand has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 16 states have internal predecessors, (73), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 05:51:05,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:51:06,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:51:08,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:51:09,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:51:09,818 INFO L93 Difference]: Finished difference Result 319 states and 452 transitions. [2024-11-07 05:51:09,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-07 05:51:09,819 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 16 states have internal predecessors, (73), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2024-11-07 05:51:09,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:51:09,822 INFO L225 Difference]: With dead ends: 319 [2024-11-07 05:51:09,822 INFO L226 Difference]: Without dead ends: 246 [2024-11-07 05:51:09,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=288, Invalid=642, Unknown=0, NotChecked=0, Total=930 [2024-11-07 05:51:09,824 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 414 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:51:09,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 338 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 7.6s Time] [2024-11-07 05:51:09,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-07 05:51:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 177. [2024-11-07 05:51:09,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-07 05:51:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 250 transitions. [2024-11-07 05:51:09,862 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 250 transitions. Word has length 150 [2024-11-07 05:51:09,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:51:09,863 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 250 transitions. [2024-11-07 05:51:09,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.294117647058823) internal successors, (73), 16 states have internal predecessors, (73), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-11-07 05:51:09,863 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 250 transitions. [2024-11-07 05:51:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-07 05:51:09,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:51:09,865 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:51:09,886 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 (5)] Forceful destruction successful, exit code 0 [2024-11-07 05:51:10,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 05:51:10,066 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:51:10,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:51:10,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1285576943, now seen corresponding path program 1 times [2024-11-07 05:51:10,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:51:10,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916957963] [2024-11-07 05:51:10,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:51:10,068 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 05:51:10,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:51:10,070 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:51:10,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 05:51:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:51:10,451 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-07 05:51:10,456 INFO L278 TraceCheckSpWp]: Computing forward predicates...