./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.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-57.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', '2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3'] 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-57.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 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:48:07,698 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:48:07,806 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:48:07,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:48:07,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:48:07,839 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:48:07,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:48:07,842 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:48:07,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:48:07,843 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:48:07,843 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:48:07,844 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:48:07,844 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:48:07,844 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:48:07,844 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:48:07,844 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:48:07,844 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:48:07,844 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:48:07,844 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:48:07,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:48:07,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:07,846 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:48:07,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:48:07,846 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 -> 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 [2024-11-07 05:48:08,124 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:48:08,131 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:48:08,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:48:08,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:48:08,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:48:08,140 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-57.i [2024-11-07 05:48:09,515 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:48:09,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:48:09,726 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-11-07 05:48:09,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cab7ebc9a/a23676dec26d496eb62a5c2215203d74/FLAG4d5038e02 [2024-11-07 05:48:10,078 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cab7ebc9a/a23676dec26d496eb62a5c2215203d74 [2024-11-07 05:48:10,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:48:10,082 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:48:10,083 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:10,083 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:48:10,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:48:10,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a90f7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10, skipping insertion in model container [2024-11-07 05:48:10,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:48:10,233 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-57.i[919,932] [2024-11-07 05:48:10,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:10,321 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:48:10,329 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-57.i[919,932] [2024-11-07 05:48:10,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:10,375 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:48:10,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10 WrapperNode [2024-11-07 05:48:10,376 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:10,377 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:10,377 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:48:10,377 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:48:10,382 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:48:10" (1/1) ... [2024-11-07 05:48:10,390 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:48:10" (1/1) ... [2024-11-07 05:48:10,448 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 276 [2024-11-07 05:48:10,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:10,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:48:10,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:48:10,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:48:10,461 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,508 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:48:10,509 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,509 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,531 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,552 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:48:10,554 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:48:10,554 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:48:10,554 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:48:10,555 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (1/1) ... [2024-11-07 05:48:10,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:10,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:10,589 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:48:10,597 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:48:10,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:48:10,614 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:48:10,614 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:48:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:48:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:48:10,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:48:10,700 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:48:10,702 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:48:11,296 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-07 05:48:11,296 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:48:11,310 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:48:11,311 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:48:11,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:11 BoogieIcfgContainer [2024-11-07 05:48:11,311 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:48:11,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:48:11,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:48:11,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:48:11,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:48:10" (1/3) ... [2024-11-07 05:48:11,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b56168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:11, skipping insertion in model container [2024-11-07 05:48:11,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:10" (2/3) ... [2024-11-07 05:48:11,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b56168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:11, skipping insertion in model container [2024-11-07 05:48:11,318 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:11" (3/3) ... [2024-11-07 05:48:11,320 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-11-07 05:48:11,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:48:11,333 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:48:11,387 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:48:11,399 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;@500512e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:48:11,399 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:48:11,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:48:11,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 05:48:11,420 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:11,421 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:11,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash -154559351, now seen corresponding path program 1 times [2024-11-07 05:48:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628725181] [2024-11-07 05:48:11,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:11,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:11,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:11,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:11,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:11,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:11,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:11,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:11,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:11,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628725181] [2024-11-07 05:48:12,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628725181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:12,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:12,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:48:12,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391850768] [2024-11-07 05:48:12,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:12,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:48:12,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:48:12,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:48:12,029 INFO L87 Difference]: Start difference. First operand has 120 states, 85 states have (on average 1.4588235294117646) internal successors, (124), 86 states have internal predecessors, (124), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:12,058 INFO L93 Difference]: Finished difference Result 233 states and 402 transitions. [2024-11-07 05:48:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:48:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 212 [2024-11-07 05:48:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:12,065 INFO L225 Difference]: With dead ends: 233 [2024-11-07 05:48:12,065 INFO L226 Difference]: Without dead ends: 116 [2024-11-07 05:48:12,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:48:12,072 INFO L432 NwaCegarLoop]: 181 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, 181 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:48:12,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-07 05:48:12,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-07 05:48:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 82 states have internal predecessors, (117), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:48:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 181 transitions. [2024-11-07 05:48:12,129 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 181 transitions. Word has length 212 [2024-11-07 05:48:12,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:12,129 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 181 transitions. [2024-11-07 05:48:12,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 181 transitions. [2024-11-07 05:48:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2024-11-07 05:48:12,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:12,134 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:48:12,134 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:12,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:12,135 INFO L85 PathProgramCache]: Analyzing trace with hash -587160831, now seen corresponding path program 1 times [2024-11-07 05:48:12,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:12,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803819447] [2024-11-07 05:48:12,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:12,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:12,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:12,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:12,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:12,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:12,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:12,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803819447] [2024-11-07 05:48:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803819447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:12,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566034363] [2024-11-07 05:48:12,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:12,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:12,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:12,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:12,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:12,753 INFO L87 Difference]: Start difference. First operand 116 states and 181 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:12,800 INFO L93 Difference]: Finished difference Result 230 states and 361 transitions. [2024-11-07 05:48:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:12,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 212 [2024-11-07 05:48:12,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:12,806 INFO L225 Difference]: With dead ends: 230 [2024-11-07 05:48:12,806 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 05:48:12,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 67 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:48:12,807 INFO L432 NwaCegarLoop]: 180 mSDtfsCounter, 0 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:12,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 354 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:12,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 05:48:12,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-11-07 05:48:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:48:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 182 transitions. [2024-11-07 05:48:12,834 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 182 transitions. Word has length 212 [2024-11-07 05:48:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:12,838 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 182 transitions. [2024-11-07 05:48:12,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:12,838 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 182 transitions. [2024-11-07 05:48:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 05:48:12,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:12,842 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:48:12,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:12,843 INFO L85 PathProgramCache]: Analyzing trace with hash -563422934, now seen corresponding path program 1 times [2024-11-07 05:48:12,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:12,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13022098] [2024-11-07 05:48:12,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:12,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:13,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:13,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:13,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:13,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:13,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:13,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:13,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:13,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:13,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13022098] [2024-11-07 05:48:13,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13022098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:13,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:13,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 05:48:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744654888] [2024-11-07 05:48:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:13,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 05:48:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:13,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 05:48:13,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:48:13,927 INFO L87 Difference]: Start difference. First operand 117 states and 182 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:15,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:15,190 INFO L93 Difference]: Finished difference Result 488 states and 747 transitions. [2024-11-07 05:48:15,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 05:48:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-07 05:48:15,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:15,197 INFO L225 Difference]: With dead ends: 488 [2024-11-07 05:48:15,200 INFO L226 Difference]: Without dead ends: 374 [2024-11-07 05:48:15,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:48:15,202 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 401 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:15,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 1029 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 05:48:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-11-07 05:48:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 324. [2024-11-07 05:48:15,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 247 states have (on average 1.45748987854251) internal successors, (360), 249 states have internal predecessors, (360), 72 states have call successors, (72), 4 states have call predecessors, (72), 4 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-07 05:48:15,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 504 transitions. [2024-11-07 05:48:15,258 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 504 transitions. Word has length 213 [2024-11-07 05:48:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:15,260 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 504 transitions. [2024-11-07 05:48:15,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 504 transitions. [2024-11-07 05:48:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-07 05:48:15,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:15,265 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:48:15,266 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:15,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:15,267 INFO L85 PathProgramCache]: Analyzing trace with hash -703971544, now seen corresponding path program 1 times [2024-11-07 05:48:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358823831] [2024-11-07 05:48:15,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:15,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:15,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:15,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:15,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:15,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:15,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:15,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:15,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:15,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:15,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:15,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358823831] [2024-11-07 05:48:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358823831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:15,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:15,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 05:48:15,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104614462] [2024-11-07 05:48:15,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:15,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 05:48:15,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:15,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 05:48:15,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:48:15,865 INFO L87 Difference]: Start difference. First operand 324 states and 504 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:16,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:16,812 INFO L93 Difference]: Finished difference Result 662 states and 1004 transitions. [2024-11-07 05:48:16,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 05:48:16,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 213 [2024-11-07 05:48:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:16,818 INFO L225 Difference]: With dead ends: 662 [2024-11-07 05:48:16,818 INFO L226 Difference]: Without dead ends: 514 [2024-11-07 05:48:16,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:48:16,820 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 215 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 1454 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:16,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 1454 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 05:48:16,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-07 05:48:16,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 469. [2024-11-07 05:48:16,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 380 states have (on average 1.4578947368421054) internal successors, (554), 385 states have internal predecessors, (554), 80 states have call successors, (80), 8 states have call predecessors, (80), 8 states have return successors, (80), 75 states have call predecessors, (80), 80 states have call successors, (80) [2024-11-07 05:48:16,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 714 transitions. [2024-11-07 05:48:16,897 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 714 transitions. Word has length 213 [2024-11-07 05:48:16,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:16,900 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 714 transitions. [2024-11-07 05:48:16,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:16,900 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 714 transitions. [2024-11-07 05:48:16,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 05:48:16,903 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:16,903 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:16,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:48:16,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:16,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:16,904 INFO L85 PathProgramCache]: Analyzing trace with hash -868089992, now seen corresponding path program 1 times [2024-11-07 05:48:16,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:16,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060501997] [2024-11-07 05:48:16,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:16,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:17,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:17,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:17,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:17,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:17,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:17,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:17,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:17,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:17,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:17,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060501997] [2024-11-07 05:48:17,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060501997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:17,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:17,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:48:17,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113996412] [2024-11-07 05:48:17,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:17,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:48:17,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:17,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:48:17,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:48:17,678 INFO L87 Difference]: Start difference. First operand 469 states and 714 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:19,119 INFO L93 Difference]: Finished difference Result 1313 states and 1989 transitions. [2024-11-07 05:48:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 05:48:19,120 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 214 [2024-11-07 05:48:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:19,127 INFO L225 Difference]: With dead ends: 1313 [2024-11-07 05:48:19,127 INFO L226 Difference]: Without dead ends: 847 [2024-11-07 05:48:19,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2024-11-07 05:48:19,129 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 780 mSDsluCounter, 950 mSDsCounter, 0 mSdLazyCounter, 1068 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 1068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:19,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1202 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 1068 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 05:48:19,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-07 05:48:19,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 799. [2024-11-07 05:48:19,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 664 states have (on average 1.4743975903614457) internal successors, (979), 673 states have internal predecessors, (979), 120 states have call successors, (120), 14 states have call predecessors, (120), 14 states have return successors, (120), 111 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-07 05:48:19,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1219 transitions. [2024-11-07 05:48:19,213 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1219 transitions. Word has length 214 [2024-11-07 05:48:19,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:19,214 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1219 transitions. [2024-11-07 05:48:19,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1219 transitions. [2024-11-07 05:48:19,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 05:48:19,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:19,218 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:19,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:48:19,218 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:19,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:19,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1796772993, now seen corresponding path program 1 times [2024-11-07 05:48:19,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:19,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861949284] [2024-11-07 05:48:19,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:19,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:20,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:20,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:20,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:20,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:20,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:20,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:20,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861949284] [2024-11-07 05:48:20,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861949284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:20,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:20,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:48:20,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851852123] [2024-11-07 05:48:20,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:20,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:48:20,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:20,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:48:20,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:48:20,157 INFO L87 Difference]: Start difference. First operand 799 states and 1219 transitions. Second operand has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:22,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:22,224 INFO L93 Difference]: Finished difference Result 2157 states and 3240 transitions. [2024-11-07 05:48:22,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 05:48:22,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-07 05:48:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:22,233 INFO L225 Difference]: With dead ends: 2157 [2024-11-07 05:48:22,234 INFO L226 Difference]: Without dead ends: 1361 [2024-11-07 05:48:22,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2024-11-07 05:48:22,240 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 431 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:22,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1090 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 05:48:22,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-07 05:48:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 953. [2024-11-07 05:48:22,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 812 states have (on average 1.5) internal successors, (1218), 822 states have internal predecessors, (1218), 124 states have call successors, (124), 16 states have call predecessors, (124), 16 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 05:48:22,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1466 transitions. [2024-11-07 05:48:22,350 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1466 transitions. Word has length 214 [2024-11-07 05:48:22,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:22,351 INFO L471 AbstractCegarLoop]: Abstraction has 953 states and 1466 transitions. [2024-11-07 05:48:22,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.7) internal successors, (57), 10 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:22,353 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1466 transitions. [2024-11-07 05:48:22,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 05:48:22,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:22,356 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:22,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:48:22,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:22,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1432180617, now seen corresponding path program 1 times [2024-11-07 05:48:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:22,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708793564] [2024-11-07 05:48:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:22,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:22,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:22,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:22,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:22,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708793564] [2024-11-07 05:48:22,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708793564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:22,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:22,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 05:48:22,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858338613] [2024-11-07 05:48:22,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:22,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:48:22,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:22,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:48:22,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:48:22,663 INFO L87 Difference]: Start difference. First operand 953 states and 1466 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:23,204 INFO L93 Difference]: Finished difference Result 2237 states and 3414 transitions. [2024-11-07 05:48:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:48:23,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 214 [2024-11-07 05:48:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:23,212 INFO L225 Difference]: With dead ends: 2237 [2024-11-07 05:48:23,213 INFO L226 Difference]: Without dead ends: 1287 [2024-11-07 05:48:23,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:48:23,216 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 71 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:23,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 770 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:48:23,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2024-11-07 05:48:23,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1012. [2024-11-07 05:48:23,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 871 states have (on average 1.5109070034443168) internal successors, (1316), 881 states have internal predecessors, (1316), 124 states have call successors, (124), 16 states have call predecessors, (124), 16 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 05:48:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1564 transitions. [2024-11-07 05:48:23,300 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1564 transitions. Word has length 214 [2024-11-07 05:48:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:23,300 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1564 transitions. [2024-11-07 05:48:23,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-07 05:48:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1564 transitions. [2024-11-07 05:48:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 05:48:23,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:23,304 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:23,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 05:48:23,305 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:23,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:23,305 INFO L85 PathProgramCache]: Analyzing trace with hash -930129606, now seen corresponding path program 1 times [2024-11-07 05:48:23,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:23,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129497986] [2024-11-07 05:48:23,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:23,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:23,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:23,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:23,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:23,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-07 05:48:23,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:23,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129497986] [2024-11-07 05:48:23,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129497986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:23,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:23,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 05:48:23,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246147831] [2024-11-07 05:48:23,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:23,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:48:23,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:23,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:48:23,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:48:23,683 INFO L87 Difference]: Start difference. First operand 1012 states and 1564 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:24,220 INFO L93 Difference]: Finished difference Result 2614 states and 4007 transitions. [2024-11-07 05:48:24,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:48:24,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 214 [2024-11-07 05:48:24,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:24,232 INFO L225 Difference]: With dead ends: 2614 [2024-11-07 05:48:24,232 INFO L226 Difference]: Without dead ends: 1605 [2024-11-07 05:48:24,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:48:24,235 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 237 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:24,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 432 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:48:24,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-11-07 05:48:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1027. [2024-11-07 05:48:24,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 886 states have (on average 1.5169300225733635) internal successors, (1344), 896 states have internal predecessors, (1344), 124 states have call successors, (124), 16 states have call predecessors, (124), 16 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 05:48:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1592 transitions. [2024-11-07 05:48:24,331 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1592 transitions. Word has length 214 [2024-11-07 05:48:24,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:24,331 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1592 transitions. [2024-11-07 05:48:24,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1592 transitions. [2024-11-07 05:48:24,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-11-07 05:48:24,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:24,336 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:24,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 05:48:24,336 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:24,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:24,336 INFO L85 PathProgramCache]: Analyzing trace with hash 198895133, now seen corresponding path program 1 times [2024-11-07 05:48:24,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:24,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596536135] [2024-11-07 05:48:24,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:24,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:24,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:24,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:24,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:24,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:24,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:24,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:24,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:24,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 6 proven. 87 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 05:48:24,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:24,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596536135] [2024-11-07 05:48:24,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596536135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:48:24,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137679429] [2024-11-07 05:48:24,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:24,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:24,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:24,692 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:48:24,693 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:48:24,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:24,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:48:24,870 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:25,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 643 proven. 75 refuted. 0 times theorem prover too weak. 1266 trivial. 0 not checked. [2024-11-07 05:48:25,147 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:48:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 18 proven. 75 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 05:48:25,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137679429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:48:25,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:48:25,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2024-11-07 05:48:25,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97222918] [2024-11-07 05:48:25,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:48:25,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 05:48:25,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 05:48:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:48:25,423 INFO L87 Difference]: Start difference. First operand 1027 states and 1592 transitions. Second operand has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (88), 3 states have call predecessors, (88), 3 states have call successors, (88) [2024-11-07 05:48:26,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:26,075 INFO L93 Difference]: Finished difference Result 2013 states and 3076 transitions. [2024-11-07 05:48:26,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 05:48:26,076 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (88), 3 states have call predecessors, (88), 3 states have call successors, (88) Word has length 214 [2024-11-07 05:48:26,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:26,081 INFO L225 Difference]: With dead ends: 2013 [2024-11-07 05:48:26,081 INFO L226 Difference]: Without dead ends: 989 [2024-11-07 05:48:26,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 510 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2024-11-07 05:48:26,085 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 267 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:26,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 585 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:48:26,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-11-07 05:48:26,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 977. [2024-11-07 05:48:26,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 825 states have (on average 1.4654545454545456) internal successors, (1209), 835 states have internal predecessors, (1209), 124 states have call successors, (124), 27 states have call predecessors, (124), 27 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 05:48:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1457 transitions. [2024-11-07 05:48:26,175 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1457 transitions. Word has length 214 [2024-11-07 05:48:26,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:26,176 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1457 transitions. [2024-11-07 05:48:26,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.666666666666666) internal successors, (104), 12 states have internal predecessors, (104), 3 states have call successors, (86), 2 states have call predecessors, (86), 4 states have return successors, (88), 3 states have call predecessors, (88), 3 states have call successors, (88) [2024-11-07 05:48:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1457 transitions. [2024-11-07 05:48:26,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-07 05:48:26,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:26,180 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:26,199 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:48:26,381 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:48:26,382 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:26,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:26,382 INFO L85 PathProgramCache]: Analyzing trace with hash 999370466, now seen corresponding path program 1 times [2024-11-07 05:48:26,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:26,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592703833] [2024-11-07 05:48:26,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:26,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:26,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:26,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 05:48:26,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:48:26,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 05:48:26,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:48:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:48:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 05:48:26,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 05:48:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-07 05:48:26,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-07 05:48:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-07 05:48:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-07 05:48:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 05:48:26,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-07 05:48:26,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 05:48:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-07 05:48:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:48:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:48:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:48:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:48:26,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:48:26,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:48:26,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:48:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:48:26,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-07 05:48:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:48:26,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-07 05:48:26,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 05:48:26,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592703833] [2024-11-07 05:48:26,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592703833] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 05:48:26,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497925816] [2024-11-07 05:48:26,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:26,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:26,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:26,741 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:48:26,742 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:48:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:26,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-07 05:48:26,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:26,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 423 proven. 9 refuted. 0 times theorem prover too weak. 1552 trivial. 0 not checked. [2024-11-07 05:48:26,982 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:48:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 84 proven. 9 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 05:48:27,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497925816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:48:27,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 05:48:27,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2024-11-07 05:48:27,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419439158] [2024-11-07 05:48:27,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 05:48:27,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:48:27,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:27,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:48:27,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:48:27,196 INFO L87 Difference]: Start difference. First operand 977 states and 1457 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-07 05:48:27,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:27,509 INFO L93 Difference]: Finished difference Result 1958 states and 2907 transitions. [2024-11-07 05:48:27,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 05:48:27,510 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 215 [2024-11-07 05:48:27,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:27,515 INFO L225 Difference]: With dead ends: 1958 [2024-11-07 05:48:27,515 INFO L226 Difference]: Without dead ends: 984 [2024-11-07 05:48:27,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 490 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-07 05:48:27,518 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 125 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:27,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 479 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:48:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2024-11-07 05:48:27,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 978. [2024-11-07 05:48:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 823 states have (on average 1.4034021871202915) internal successors, (1155), 833 states have internal predecessors, (1155), 124 states have call successors, (124), 30 states have call predecessors, (124), 30 states have return successors, (124), 114 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-07 05:48:27,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1403 transitions. [2024-11-07 05:48:27,623 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1403 transitions. Word has length 215 [2024-11-07 05:48:27,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:27,623 INFO L471 AbstractCegarLoop]: Abstraction has 978 states and 1403 transitions. [2024-11-07 05:48:27,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 10 states have internal predecessors, (108), 4 states have call successors, (38), 2 states have call predecessors, (38), 4 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-07 05:48:27,624 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1403 transitions. [2024-11-07 05:48:27,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-07 05:48:27,627 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:27,627 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:27,645 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:48:27,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:27,832 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:27,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:27,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1859292764, now seen corresponding path program 1 times [2024-11-07 05:48:27,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:27,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531447715] [2024-11-07 05:48:27,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:27,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:48:27,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2025512927] [2024-11-07 05:48:27,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:27,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:27,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:27,928 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:48:27,929 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:48:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:28,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-07 05:48:28,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:28,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1030 proven. 96 refuted. 0 times theorem prover too weak. 858 trivial. 0 not checked. [2024-11-07 05:48:28,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 05:48:29,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2024-11-07 05:48:29,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:29,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531447715] [2024-11-07 05:48:29,750 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 05:48:29,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025512927] [2024-11-07 05:48:29,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025512927] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 05:48:29,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 05:48:29,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-07 05:48:29,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863726516] [2024-11-07 05:48:29,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 05:48:29,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-07 05:48:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:29,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-07 05:48:29,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2024-11-07 05:48:29,752 INFO L87 Difference]: Start difference. First operand 978 states and 1403 transitions. Second operand has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-11-07 05:48:31,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:31,728 INFO L93 Difference]: Finished difference Result 2369 states and 3310 transitions. [2024-11-07 05:48:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-07 05:48:31,729 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) Word has length 216 [2024-11-07 05:48:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:31,737 INFO L225 Difference]: With dead ends: 2369 [2024-11-07 05:48:31,737 INFO L226 Difference]: Without dead ends: 1394 [2024-11-07 05:48:31,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 411 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2024-11-07 05:48:31,741 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 453 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 30 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:31,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 906 Invalid, 1368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1326 Invalid, 12 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 05:48:31,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2024-11-07 05:48:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 1179. [2024-11-07 05:48:31,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 961 states have (on average 1.347554630593132) internal successors, (1295), 974 states have internal predecessors, (1295), 166 states have call successors, (166), 51 states have call predecessors, (166), 51 states have return successors, (166), 153 states have call predecessors, (166), 166 states have call successors, (166) [2024-11-07 05:48:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1627 transitions. [2024-11-07 05:48:31,879 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1627 transitions. Word has length 216 [2024-11-07 05:48:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:31,880 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1627 transitions. [2024-11-07 05:48:31,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.391304347826087) internal successors, (101), 22 states have internal predecessors, (101), 4 states have call successors, (49), 3 states have call predecessors, (49), 5 states have return successors, (50), 4 states have call predecessors, (50), 4 states have call successors, (50) [2024-11-07 05:48:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1627 transitions. [2024-11-07 05:48:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2024-11-07 05:48:31,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:31,884 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:31,902 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:48:32,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:32,085 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:32,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:32,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1843391779, now seen corresponding path program 1 times [2024-11-07 05:48:32,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:32,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751601392] [2024-11-07 05:48:32,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:32,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 05:48:32,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163787158] [2024-11-07 05:48:32,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:32,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 05:48:32,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:32,210 INFO L229 MonitoredProcess]: Starting monitored process 5 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:48:32,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 05:48:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:48:32,819 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:48:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:48:33,246 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:48:33,246 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:48:33,247 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:48:33,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 05:48:33,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-07 05:48:33,452 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:33,568 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:48:33,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:48:33 BoogieIcfgContainer [2024-11-07 05:48:33,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:48:33,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:48:33,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:48:33,572 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:48:33,573 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:11" (3/4) ... [2024-11-07 05:48:33,574 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:48:33,575 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:48:33,576 INFO L158 Benchmark]: Toolchain (without parser) took 23494.12ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 91.6MB in the beginning and 315.3MB in the end (delta: -223.8MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-11-07 05:48:33,576 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:48:33,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 293.44ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 75.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:48:33,576 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.04ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 69.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:48:33,576 INFO L158 Benchmark]: Boogie Preprocessor took 99.99ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 62.3MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:48:33,577 INFO L158 Benchmark]: RCFGBuilder took 757.67ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 68.8MB in the end (delta: -6.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-11-07 05:48:33,577 INFO L158 Benchmark]: TraceAbstraction took 22258.48ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 68.3MB in the beginning and 319.5MB in the end (delta: -251.2MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. [2024-11-07 05:48:33,577 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 419.4MB. Free memory was 319.5MB in the beginning and 315.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:48:33,578 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.34ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 293.44ms. Allocated memory is still 117.4MB. Free memory was 91.4MB in the beginning and 75.6MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.04ms. Allocated memory is still 117.4MB. Free memory was 75.6MB in the beginning and 69.1MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.99ms. Allocated memory is still 117.4MB. Free memory was 69.1MB in the beginning and 62.3MB in the end (delta: 6.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 757.67ms. Allocated memory is still 117.4MB. Free memory was 62.3MB in the beginning and 68.8MB in the end (delta: -6.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * TraceAbstraction took 22258.48ms. Allocated memory was 117.4MB in the beginning and 419.4MB in the end (delta: 302.0MB). Free memory was 68.3MB in the beginning and 319.5MB in the end (delta: -251.2MB). Peak memory consumption was 50.8MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 419.4MB. Free memory was 319.5MB in the beginning and 315.3MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of bitwiseOr at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 59, overapproximation of someUnaryDOUBLEoperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 185. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 5; [L23] signed char var_1_2 = -1; [L24] signed char var_1_3 = 10; [L25] signed long int var_1_5 = 5; [L26] unsigned char var_1_6 = 0; [L27] double var_1_7 = 24.8; [L28] double var_1_8 = 500.5; [L29] double var_1_9 = 2.4; [L30] double var_1_10 = 0.4; [L31] double var_1_11 = 255.8; [L32] double var_1_12 = 50.75; [L33] unsigned char var_1_13 = 4; [L34] unsigned char var_1_14 = 200; [L35] unsigned char var_1_15 = 25; [L36] unsigned char var_1_16 = 128; [L37] unsigned char var_1_17 = 64; [L38] unsigned char var_1_18 = 32; [L39] unsigned char var_1_19 = 32; [L40] unsigned long int var_1_20 = 1; [L41] float var_1_21 = 9999999999.2; [L42] double var_1_23 = 10.875; [L43] unsigned char var_1_24 = 0; [L44] unsigned char var_1_25 = 0; [L45] float var_1_26 = 1000000000000.6; [L46] unsigned long int var_1_27 = 2609431563; [L47] float var_1_30 = 8.8; [L48] unsigned short int var_1_32 = 1; [L49] signed char var_1_36 = 64; [L50] float var_1_37 = 9.5; [L51] signed long int var_1_41 = 200; [L52] signed char var_1_42 = 2; [L53] signed long int var_1_43 = 2; VAL [isInitial=0, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=-1, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L189] isInitial = 1 [L190] FCALL initially() [L191] COND TRUE 1 [L192] FCALL updateLastVariables() [L193] CALL updateVariables() [L131] var_1_2 = __VERIFIER_nondet_char() [L132] CALL assume_abort_if_not(var_1_2 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L132] RET assume_abort_if_not(var_1_2 >= -1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L133] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=10, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L134] var_1_3 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L136] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=5, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L137] var_1_5 = __VERIFIER_nondet_long() [L138] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L138] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L139] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L140] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=0, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L141] var_1_6 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L142] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L143] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5, var_1_8=1001/2, var_1_9=12/5] [L144] var_1_8 = __VERIFIER_nondet_double() [L145] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L145] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5, var_1_9=12/5] [L146] var_1_9 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L147] RET assume_abort_if_not((var_1_9 >= -230584.3009213691390e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 2305843.009213691390e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=2/5, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L148] var_1_10 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L149] RET assume_abort_if_not((var_1_10 >= -230584.3009213691390e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 2305843.009213691390e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=1279/5, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L150] var_1_11 = __VERIFIER_nondet_double() [L151] CALL assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L151] RET assume_abort_if_not((var_1_11 >= -115292.1504606845700e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 1152921.504606845700e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=203/4, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L152] var_1_12 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L153] RET assume_abort_if_not((var_1_12 >= -115292.1504606845700e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 1152921.504606845700e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=200, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L154] var_1_14 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_14 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L155] RET assume_abort_if_not(var_1_14 >= 190) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L156] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L156] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=25, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L157] var_1_15 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L158] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L159] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L159] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=128, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L160] var_1_16 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_16 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L161] RET assume_abort_if_not(var_1_16 >= 127) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L162] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L162] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=64, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L163] var_1_17 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L164] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L165] CALL assume_abort_if_not(var_1_17 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L165] RET assume_abort_if_not(var_1_17 <= 64) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=32, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L166] var_1_18 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L167] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L168] CALL assume_abort_if_not(var_1_18 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L168] RET assume_abort_if_not(var_1_18 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=32, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L169] var_1_19 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L170] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L171] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L171] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L172] var_1_25 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L173] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L174] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L174] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=2609431563, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L175] var_1_27 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_27 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L176] RET assume_abort_if_not(var_1_27 >= 2147483647) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L177] CALL assume_abort_if_not(var_1_27 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L177] RET assume_abort_if_not(var_1_27 <= 4294967295) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_37=19/2, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L178] var_1_37 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L179] RET assume_abort_if_not((var_1_37 >= -922337.2036854776000e+13F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854776000e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L180] CALL assume_abort_if_not(var_1_37 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L180] RET assume_abort_if_not(var_1_37 != 0.0F) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L193] RET updateVariables() [L194] CALL step() [L57] signed char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=0, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_7=124/5] [L58] COND TRUE -256 <= stepLocal_0 [L59] var_1_7 = (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))) VAL [isInitial=1, var_1_13=4, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L65] COND TRUE var_1_11 <= var_1_9 [L66] var_1_13 = ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))) VAL [isInitial=1, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=5, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L68] COND TRUE (var_1_2 - var_1_3) > (var_1_13 / var_1_5) [L69] var_1_1 = (128 - var_1_3) VAL [isInitial=1, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L77] EXPR (var_1_2 * var_1_13) & var_1_1 VAL [isInitial=1, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L77] signed long int stepLocal_1 = (var_1_2 * var_1_13) & var_1_1; [L78] COND FALSE !(var_1_3 < stepLocal_1) VAL [isInitial=1, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L81] EXPR var_1_1 & var_1_3 VAL [isInitial=1, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=49999999996/5, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L81] signed long int stepLocal_2 = var_1_1 & var_1_3; [L82] COND FALSE !((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= stepLocal_2) [L89] var_1_21 = var_1_12 VAL [isInitial=1, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L91] unsigned long int stepLocal_3 = var_1_20; VAL [isInitial=1, stepLocal_3=1, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L92] COND TRUE var_1_1 > stepLocal_3 VAL [isInitial=1, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=87/8, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1] [L93] COND TRUE ! (! var_1_6) [L94] var_1_23 = var_1_8 VAL [isInitial=1, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L97] var_1_24 = var_1_25 VAL [isInitial=1, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L98] EXPR 25u | (var_1_27 - 5u) VAL [isInitial=1, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=5000000000003/5, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L98] COND TRUE (25u | (var_1_27 - 5u)) >= var_1_5 [L99] var_1_26 = (((((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) < 0 ) ? -((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) : ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=44/5, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L105] COND TRUE var_1_10 < var_1_8 [L106] var_1_30 = ((((var_1_8) > (var_1_11)) ? (var_1_8) : (var_1_11))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L108] EXPR (var_1_1 / var_1_14) & var_1_5 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L108] COND TRUE (-1 - var_1_15) < ((var_1_1 / var_1_14) & var_1_5) [L109] EXPR var_1_14 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=1, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L109] COND TRUE (- ((((var_1_5) < 0 ) ? -(var_1_5) : (var_1_5)))) < (var_1_14 >> var_1_15) [L110] var_1_32 = var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=64, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L117] COND FALSE !(var_1_10 < ((var_1_8 / var_1_37) + var_1_11)) [L122] var_1_36 = ((((var_1_18) > ((var_1_18 - var_1_18))) ? (var_1_18) : ((var_1_18 - var_1_18)))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L124] EXPR var_1_27 >> var_1_15 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=2, var_1_43=2, var_1_5=-63, var_1_6=1, var_1_8=3] [L124] COND FALSE !((var_1_27 >> var_1_15) <= var_1_18) [L127] var_1_42 = var_1_17 [L128] var_1_43 = var_1_3 VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=0, var_1_43=0, var_1_5=-63, var_1_6=1, var_1_8=3] [L194] RET step() [L195] CALL, EXPR property() [L185] EXPR (((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=0, var_1_43=0, var_1_5=-63, var_1_6=1, var_1_8=3] [L185] EXPR ((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12))) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=0, var_1_43=0, var_1_5=-63, var_1_6=1, var_1_8=3] [L185-L186] return (((((((var_1_2 - var_1_3) > (var_1_13 / var_1_5)) ? (var_1_1 == ((unsigned char) (128 - var_1_3))) : ((! var_1_6) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((-256 <= var_1_2) ? (var_1_7 == ((double) (var_1_8 + (((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) + (var_1_11 + var_1_12))))) : ((var_1_11 == var_1_9) ? (var_1_7 == ((double) var_1_8)) : 1))) && ((var_1_11 <= var_1_9) ? (var_1_13 == ((unsigned char) ((((((var_1_14 - var_1_15)) > (var_1_16)) ? ((var_1_14 - var_1_15)) : (var_1_16))) - (var_1_17 + ((((var_1_18) > (var_1_19)) ? (var_1_18) : (var_1_19))))))) : 1)) && ((var_1_3 < ((var_1_2 * var_1_13) & var_1_1)) ? (var_1_20 == ((unsigned long int) (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) + var_1_14))) : 1)) && (((((((var_1_1) > (var_1_5)) ? (var_1_1) : (var_1_5))) + (var_1_1 / var_1_14)) <= (var_1_1 & var_1_3)) ? (var_1_6 ? (var_1_21 == ((float) var_1_12)) : (var_1_21 == ((float) var_1_10))) : (var_1_21 == ((float) var_1_12)))) && ((var_1_1 > var_1_20) ? ((! (! var_1_6)) ? (var_1_23 == ((double) var_1_8)) : 1) : 1) ; [L195] RET, EXPR property() [L195] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=0, var_1_43=0, var_1_5=-63, var_1_6=1, var_1_8=3] [L19] reach_error() VAL [isInitial=1, var_1_11=0, var_1_12=2, var_1_13=253, var_1_14=254, var_1_15=0, var_1_16=253, var_1_17=512, var_1_18=-255, var_1_19=256, var_1_1=128, var_1_20=1, var_1_21=2, var_1_23=3, var_1_24=0, var_1_25=0, var_1_26=4, var_1_27=8589934512, var_1_2=0, var_1_30=3, var_1_32=0, var_1_36=1, var_1_3=0, var_1_41=200, var_1_42=0, var_1_43=0, var_1_5=-63, var_1_6=1, var_1_8=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 120 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.1s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 12 mSolverCounterUnknown, 3039 SdHoareTripleChecker+Valid, 7.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2980 mSDsluCounter, 8482 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6510 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6144 IncrementalHoareTripleChecker+Invalid, 6476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 1972 mSDtfsCounter, 6144 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2110 GetRequests, 1966 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1179occurred in iteration=11, InterpolantAutomatonStates: 119, 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, 11 MinimizatonAttempts, 1637 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 3430 NumberOfCodeBlocks, 3430 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 3409 ConstructedInterpolants, 1 QuantifiedInterpolants, 10204 SizeOfPredicates, 15 NumberOfNonLiveVariables, 1440 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 31333/31744 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:48:33,658 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-57.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 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:48:35,740 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:48:35,797 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:48:35,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:48:35,822 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:48:35,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:48:35,894 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:48:35,894 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:48:35,895 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:48:35,895 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:48:35,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:48:35,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:48:35,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:48:35,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:48:35,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:48:35,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:48:35,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:48:35,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:48:35,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:48:35,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:48:35,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:48:35,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:35,901 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:48:35,901 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:48:35,901 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:48:35,901 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:48:35,901 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:48:35,901 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:48:35,901 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:48:35,902 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:48:35,902 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:48:35,902 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 -> 2add2f6a05efd3a958590ac2ce53eb78a564401181f189a0f9c561805fb8c5f3 [2024-11-07 05:48:36,148 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:48:36,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:48:36,160 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:48:36,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:48:36,161 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:48:36,166 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-57.i [2024-11-07 05:48:37,426 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:48:37,637 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:48:37,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-11-07 05:48:37,648 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bafbfa4d/601f473efc934aa7a0a2fbd7effdc939/FLAGbbc133f07 [2024-11-07 05:48:37,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bafbfa4d/601f473efc934aa7a0a2fbd7effdc939 [2024-11-07 05:48:37,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:48:37,674 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:48:37,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:37,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:48:37,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:48:37,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:37" (1/1) ... [2024-11-07 05:48:37,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398556c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:37, skipping insertion in model container [2024-11-07 05:48:37,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:37" (1/1) ... [2024-11-07 05:48:37,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:48:37,831 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-57.i[919,932] [2024-11-07 05:48:37,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:37,933 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:48:37,943 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-57.i[919,932] [2024-11-07 05:48:37,986 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:38,003 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:48:38,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38 WrapperNode [2024-11-07 05:48:38,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:38,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:38,006 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:48:38,006 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:48:38,013 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:48:38" (1/1) ... [2024-11-07 05:48:38,029 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:48:38" (1/1) ... [2024-11-07 05:48:38,066 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 197 [2024-11-07 05:48:38,066 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:38,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:48:38,069 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:48:38,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:48:38,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,085 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,104 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:48:38,105 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,105 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,129 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,134 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,140 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:48:38,142 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:48:38,142 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:48:38,142 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:48:38,143 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (1/1) ... [2024-11-07 05:48:38,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:38,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:38,174 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:48:38,181 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:48:38,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:48:38,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:48:38,198 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:48:38,198 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:48:38,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:48:38,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:48:38,300 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:48:38,302 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:48:53,635 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-07 05:48:53,636 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:48:53,647 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:48:53,648 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:48:53,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:53 BoogieIcfgContainer [2024-11-07 05:48:53,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:48:53,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:48:53,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:48:53,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:48:53,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:48:37" (1/3) ... [2024-11-07 05:48:53,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352baadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:53, skipping insertion in model container [2024-11-07 05:48:53,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:38" (2/3) ... [2024-11-07 05:48:53,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352baadd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:53, skipping insertion in model container [2024-11-07 05:48:53,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:53" (3/3) ... [2024-11-07 05:48:53,659 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-57.i [2024-11-07 05:48:53,672 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:48:53,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:48:53,748 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:48:53,759 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;@6d89f6d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:48:53,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:48:53,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:48:53,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 05:48:53,779 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:53,780 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:53,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:53,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:53,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1459535644, now seen corresponding path program 1 times [2024-11-07 05:48:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:53,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894091695] [2024-11-07 05:48:53,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:53,799 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:48:53,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:53,802 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:48:53,806 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:48:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:48:54,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:48:55,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-07 05:48:55,004 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:48:55,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:48:55,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894091695] [2024-11-07 05:48:55,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894091695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:55,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:55,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:48:55,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200802664] [2024-11-07 05:48:55,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:55,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:48:55,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:48:55,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:48:55,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:48:55,033 INFO L87 Difference]: Start difference. First operand has 92 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 58 states have internal predecessors, (80), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:55,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:55,065 INFO L93 Difference]: Finished difference Result 176 states and 312 transitions. [2024-11-07 05:48:55,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:48:55,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 203 [2024-11-07 05:48:55,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:55,073 INFO L225 Difference]: With dead ends: 176 [2024-11-07 05:48:55,073 INFO L226 Difference]: Without dead ends: 87 [2024-11-07 05:48:55,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 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:48:55,078 INFO L432 NwaCegarLoop]: 134 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, 134 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:48:55,081 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:55,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-07 05:48:55,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-07 05:48:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-07 05:48:55,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 134 transitions. [2024-11-07 05:48:55,120 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 134 transitions. Word has length 203 [2024-11-07 05:48:55,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:55,121 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 134 transitions. [2024-11-07 05:48:55,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-07 05:48:55,121 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 134 transitions. [2024-11-07 05:48:55,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-07 05:48:55,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:55,127 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48:55,168 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:48:55,328 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:48:55,328 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:55,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash -836070548, now seen corresponding path program 1 times [2024-11-07 05:48:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:48:55,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [316494011] [2024-11-07 05:48:55,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:55,330 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:48:55,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:48:55,333 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:48:55,334 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:48:56,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-07 05:48:56,862 INFO L278 TraceCheckSpWp]: Computing forward predicates...