./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.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-ps-cn_file-40.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', 'ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef'] 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-ps-cn_file-40.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 ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:03:36,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:03:36,715 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 07:03:36,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:03:36,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:03:36,755 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:03:36,757 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:03:36,757 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:03:36,758 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:03:36,758 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:03:36,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:03:36,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:03:36,759 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:03:36,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:03:36,759 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:03:36,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:03:36,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:03:36,761 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:03:36,761 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:03:36,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:03:36,761 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:03:36,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:03:36,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:03:36,761 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:03:36,762 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:03:36,762 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:03:36,762 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:03:36,762 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:03:36,762 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:03:36,763 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:03:36,763 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:03:36,763 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:03:36,763 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:03:36,763 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:03:36,763 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:03:36,763 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 -> ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef [2024-11-07 07:03:37,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:03:37,083 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:03:37,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:03:37,087 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:03:37,087 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:03:37,088 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-ps-cn_file-40.i [2024-11-07 07:03:38,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:03:38,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:03:38,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-07 07:03:38,705 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04962fbcd/4babf94bd33c441083dc845db140798b/FLAGe9e090376 [2024-11-07 07:03:38,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/04962fbcd/4babf94bd33c441083dc845db140798b [2024-11-07 07:03:38,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:03:38,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:03:38,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:03:38,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:03:38,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:03:38,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:03:38" (1/1) ... [2024-11-07 07:03:38,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@873eb6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:38, skipping insertion in model container [2024-11-07 07:03:38,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:03:38" (1/1) ... [2024-11-07 07:03:38,765 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:03:38,899 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-ps-cn_file-40.i[919,932] [2024-11-07 07:03:39,006 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:03:39,020 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:03:39,030 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-ps-cn_file-40.i[919,932] [2024-11-07 07:03:39,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:03:39,088 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:03:39,088 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39 WrapperNode [2024-11-07 07:03:39,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:03:39,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:03:39,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:03:39,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:03:39,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,155 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 199 [2024-11-07 07:03:39,155 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:03:39,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:03:39,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:03:39,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:03:39,170 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,205 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:03:39,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,235 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:03:39,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:03:39,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:03:39,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:03:39,241 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (1/1) ... [2024-11-07 07:03:39,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:03:39,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:03:39,276 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:03:39,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:03:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:03:39,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:03:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:03:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:03:39,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:03:39,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:03:39,406 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:03:39,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:03:39,930 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:03:39,931 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:03:39,944 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:03:39,945 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:03:39,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:03:39 BoogieIcfgContainer [2024-11-07 07:03:39,945 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:03:39,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:03:39,947 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:03:39,951 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:03:39,951 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:03:38" (1/3) ... [2024-11-07 07:03:39,952 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b3555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:03:39, skipping insertion in model container [2024-11-07 07:03:39,952 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:39" (2/3) ... [2024-11-07 07:03:39,953 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17b3555a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:03:39, skipping insertion in model container [2024-11-07 07:03:39,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:03:39" (3/3) ... [2024-11-07 07:03:39,954 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-07 07:03:39,970 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:03:39,971 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:03:40,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:03:40,047 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;@67046816, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:03:40,047 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:03:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:03:40,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 07:03:40,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:40,068 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:40,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:40,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:40,075 INFO L85 PathProgramCache]: Analyzing trace with hash 2098810620, now seen corresponding path program 1 times [2024-11-07 07:03:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553034846] [2024-11-07 07:03:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:40,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:40,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:40,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:40,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:40,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:40,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:40,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:40,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553034846] [2024-11-07 07:03:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553034846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:03:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157824313] [2024-11-07 07:03:40,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:40,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:03:40,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:40,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:03:40,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:03:40,785 INFO L87 Difference]: Start difference. First operand has 86 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 58 states have internal predecessors, (82), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:40,814 INFO L93 Difference]: Finished difference Result 165 states and 288 transitions. [2024-11-07 07:03:40,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:03:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-07 07:03:40,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:40,827 INFO L225 Difference]: With dead ends: 165 [2024-11-07 07:03:40,827 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 07:03:40,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:03:40,835 INFO L432 NwaCegarLoop]: 126 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, 126 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:40,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:03:40,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 07:03:40,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 07:03:40,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:03:40,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 126 transitions. [2024-11-07 07:03:40,894 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 126 transitions. Word has length 173 [2024-11-07 07:03:40,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:40,898 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 126 transitions. [2024-11-07 07:03:40,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:40,899 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 126 transitions. [2024-11-07 07:03:40,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 07:03:40,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:40,905 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:40,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:03:40,906 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:40,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:40,906 INFO L85 PathProgramCache]: Analyzing trace with hash 99329031, now seen corresponding path program 1 times [2024-11-07 07:03:40,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:40,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529226556] [2024-11-07 07:03:40,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:40,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:41,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:41,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:41,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529226556] [2024-11-07 07:03:41,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529226556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:41,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:41,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 07:03:41,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029477417] [2024-11-07 07:03:41,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:41,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 07:03:41,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:41,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 07:03:41,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:03:41,700 INFO L87 Difference]: Start difference. First operand 82 states and 126 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:41,910 INFO L93 Difference]: Finished difference Result 240 states and 372 transitions. [2024-11-07 07:03:41,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 07:03:41,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-07 07:03:41,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:41,914 INFO L225 Difference]: With dead ends: 240 [2024-11-07 07:03:41,914 INFO L226 Difference]: Without dead ends: 161 [2024-11-07 07:03:41,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 07:03:41,920 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 197 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:41,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 305 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:03:41,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-07 07:03:41,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2024-11-07 07:03:41,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 52 states have call successors, (52), 2 states have call predecessors, (52), 2 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 07:03:41,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2024-11-07 07:03:41,976 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 174 [2024-11-07 07:03:41,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:41,977 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2024-11-07 07:03:41,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:41,978 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2024-11-07 07:03:41,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 07:03:41,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:41,981 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:41,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:03:41,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:41,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:41,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1589614711, now seen corresponding path program 1 times [2024-11-07 07:03:41,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:41,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834673750] [2024-11-07 07:03:41,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:41,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:42,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:42,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:42,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:42,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:42,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:42,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834673750] [2024-11-07 07:03:42,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834673750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:42,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:42,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:03:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357869030] [2024-11-07 07:03:42,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:42,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:03:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:42,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:03:42,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:42,218 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:42,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:42,268 INFO L93 Difference]: Finished difference Result 388 states and 605 transitions. [2024-11-07 07:03:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:03:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-07 07:03:42,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:42,272 INFO L225 Difference]: With dead ends: 388 [2024-11-07 07:03:42,272 INFO L226 Difference]: Without dead ends: 232 [2024-11-07 07:03:42,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:42,274 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 92 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:42,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 320 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:03:42,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-07 07:03:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 221. [2024-11-07 07:03:42,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 147 states have (on average 1.380952380952381) internal successors, (203), 148 states have internal predecessors, (203), 70 states have call successors, (70), 3 states have call predecessors, (70), 3 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2024-11-07 07:03:42,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 343 transitions. [2024-11-07 07:03:42,313 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 343 transitions. Word has length 174 [2024-11-07 07:03:42,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:42,313 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 343 transitions. [2024-11-07 07:03:42,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:42,314 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 343 transitions. [2024-11-07 07:03:42,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-07 07:03:42,316 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:42,316 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:42,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:03:42,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:42,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1449066101, now seen corresponding path program 1 times [2024-11-07 07:03:42,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:42,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088456750] [2024-11-07 07:03:42,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:42,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:42,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:42,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:42,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:42,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:42,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088456750] [2024-11-07 07:03:42,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088456750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:42,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:42,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:03:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96994847] [2024-11-07 07:03:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:42,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:03:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:42,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:03:42,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:42,737 INFO L87 Difference]: Start difference. First operand 221 states and 343 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:42,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:42,803 INFO L93 Difference]: Finished difference Result 526 states and 820 transitions. [2024-11-07 07:03:42,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:03:42,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 174 [2024-11-07 07:03:42,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:42,811 INFO L225 Difference]: With dead ends: 526 [2024-11-07 07:03:42,812 INFO L226 Difference]: Without dead ends: 308 [2024-11-07 07:03:42,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:42,815 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 71 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:42,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 272 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:03:42,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-07 07:03:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 298. [2024-11-07 07:03:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 197 states have (on average 1.380710659898477) internal successors, (272), 198 states have internal predecessors, (272), 96 states have call successors, (96), 4 states have call predecessors, (96), 4 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-07 07:03:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 464 transitions. [2024-11-07 07:03:42,901 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 464 transitions. Word has length 174 [2024-11-07 07:03:42,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:42,903 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 464 transitions. [2024-11-07 07:03:42,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:42,903 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 464 transitions. [2024-11-07 07:03:42,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 07:03:42,906 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:42,907 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:42,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:03:42,907 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:42,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:42,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1822091790, now seen corresponding path program 1 times [2024-11-07 07:03:42,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:42,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030720768] [2024-11-07 07:03:42,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:42,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:43,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:43,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:43,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:43,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:43,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:43,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030720768] [2024-11-07 07:03:43,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030720768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:43,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:43,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:03:43,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184990133] [2024-11-07 07:03:43,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:43,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:03:43,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:43,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:03:43,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:43,144 INFO L87 Difference]: Start difference. First operand 298 states and 464 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:43,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:43,237 INFO L93 Difference]: Finished difference Result 734 states and 1143 transitions. [2024-11-07 07:03:43,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:03:43,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-07 07:03:43,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:43,244 INFO L225 Difference]: With dead ends: 734 [2024-11-07 07:03:43,245 INFO L226 Difference]: Without dead ends: 439 [2024-11-07 07:03:43,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:43,246 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 70 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:43,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 270 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:03:43,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-07 07:03:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2024-11-07 07:03:43,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 290 states have (on average 1.3724137931034484) internal successors, (398), 292 states have internal predecessors, (398), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-07 07:03:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 678 transitions. [2024-11-07 07:03:43,328 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 678 transitions. Word has length 175 [2024-11-07 07:03:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 678 transitions. [2024-11-07 07:03:43,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 678 transitions. [2024-11-07 07:03:43,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 07:03:43,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:43,331 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:43,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:03:43,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:43,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:43,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1273209232, now seen corresponding path program 1 times [2024-11-07 07:03:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264252745] [2024-11-07 07:03:43,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:43,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:43,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:43,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:43,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:43,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:43,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264252745] [2024-11-07 07:03:43,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264252745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:43,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:43,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:03:43,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054842529] [2024-11-07 07:03:43,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:43,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:03:43,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:43,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:03:43,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:43,549 INFO L87 Difference]: Start difference. First operand 437 states and 678 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:43,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:43,605 INFO L93 Difference]: Finished difference Result 871 states and 1353 transitions. [2024-11-07 07:03:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:03:43,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-07 07:03:43,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:43,611 INFO L225 Difference]: With dead ends: 871 [2024-11-07 07:03:43,612 INFO L226 Difference]: Without dead ends: 437 [2024-11-07 07:03:43,614 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:43,616 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:43,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 244 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:03:43,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-11-07 07:03:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2024-11-07 07:03:43,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 290 states have (on average 1.3517241379310345) internal successors, (392), 292 states have internal predecessors, (392), 140 states have call successors, (140), 6 states have call predecessors, (140), 6 states have return successors, (140), 138 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-07 07:03:43,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 672 transitions. [2024-11-07 07:03:43,690 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 672 transitions. Word has length 175 [2024-11-07 07:03:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:43,691 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 672 transitions. [2024-11-07 07:03:43,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:43,694 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 672 transitions. [2024-11-07 07:03:43,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 07:03:43,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:43,696 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:43,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:03:43,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:43,697 INFO L85 PathProgramCache]: Analyzing trace with hash -2082555858, now seen corresponding path program 1 times [2024-11-07 07:03:43,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:43,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75221548] [2024-11-07 07:03:43,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:44,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:44,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:44,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:44,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:44,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:44,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:44,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:44,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:44,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:44,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75221548] [2024-11-07 07:03:44,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75221548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:44,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:44,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:03:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374633740] [2024-11-07 07:03:44,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:44,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:03:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:03:44,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:03:44,151 INFO L87 Difference]: Start difference. First operand 437 states and 672 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:44,417 INFO L93 Difference]: Finished difference Result 726 states and 1116 transitions. [2024-11-07 07:03:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:03:44,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-07 07:03:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:44,422 INFO L225 Difference]: With dead ends: 726 [2024-11-07 07:03:44,423 INFO L226 Difference]: Without dead ends: 508 [2024-11-07 07:03:44,424 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:03:44,427 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 175 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:44,427 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 462 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:03:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-07 07:03:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 485. [2024-11-07 07:03:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 325 states have (on average 1.353846153846154) internal successors, (440), 328 states have internal predecessors, (440), 152 states have call successors, (152), 7 states have call predecessors, (152), 7 states have return successors, (152), 149 states have call predecessors, (152), 152 states have call successors, (152) [2024-11-07 07:03:44,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 744 transitions. [2024-11-07 07:03:44,483 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 744 transitions. Word has length 175 [2024-11-07 07:03:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:44,483 INFO L471 AbstractCegarLoop]: Abstraction has 485 states and 744 transitions. [2024-11-07 07:03:44,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 744 transitions. [2024-11-07 07:03:44,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-07 07:03:44,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:44,485 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:44,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:03:44,486 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:44,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:44,486 INFO L85 PathProgramCache]: Analyzing trace with hash 624063536, now seen corresponding path program 1 times [2024-11-07 07:03:44,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:44,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123169023] [2024-11-07 07:03:44,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:44,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:44,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:44,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:44,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:44,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:44,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:44,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:44,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:44,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:44,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:44,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:44,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:44,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:44,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:44,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:44,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123169023] [2024-11-07 07:03:44,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123169023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:44,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:44,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:03:44,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478016440] [2024-11-07 07:03:44,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:03:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:44,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:03:44,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:03:44,906 INFO L87 Difference]: Start difference. First operand 485 states and 744 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:45,186 INFO L93 Difference]: Finished difference Result 889 states and 1363 transitions. [2024-11-07 07:03:45,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:03:45,187 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 175 [2024-11-07 07:03:45,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:45,192 INFO L225 Difference]: With dead ends: 889 [2024-11-07 07:03:45,192 INFO L226 Difference]: Without dead ends: 622 [2024-11-07 07:03:45,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:03:45,194 INFO L432 NwaCegarLoop]: 197 mSDtfsCounter, 181 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:45,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 526 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:03:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2024-11-07 07:03:45,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 543. [2024-11-07 07:03:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 370 states have (on average 1.3621621621621622) internal successors, (504), 374 states have internal predecessors, (504), 164 states have call successors, (164), 8 states have call predecessors, (164), 8 states have return successors, (164), 160 states have call predecessors, (164), 164 states have call successors, (164) [2024-11-07 07:03:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 832 transitions. [2024-11-07 07:03:45,257 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 832 transitions. Word has length 175 [2024-11-07 07:03:45,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:45,258 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 832 transitions. [2024-11-07 07:03:45,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 832 transitions. [2024-11-07 07:03:45,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 07:03:45,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:45,260 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:45,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:03:45,261 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:45,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:45,261 INFO L85 PathProgramCache]: Analyzing trace with hash 308152387, now seen corresponding path program 1 times [2024-11-07 07:03:45,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:45,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991246179] [2024-11-07 07:03:45,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:45,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:45,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:45,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:45,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:45,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:45,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:45,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991246179] [2024-11-07 07:03:45,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991246179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:45,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:45,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:03:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524628524] [2024-11-07 07:03:45,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:45,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:03:45,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:45,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:03:45,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:45,585 INFO L87 Difference]: Start difference. First operand 543 states and 832 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:45,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:45,686 INFO L93 Difference]: Finished difference Result 959 states and 1461 transitions. [2024-11-07 07:03:45,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:03:45,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-07 07:03:45,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:45,694 INFO L225 Difference]: With dead ends: 959 [2024-11-07 07:03:45,694 INFO L226 Difference]: Without dead ends: 686 [2024-11-07 07:03:45,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:03:45,698 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 67 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:45,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 299 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:03:45,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-11-07 07:03:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 638. [2024-11-07 07:03:45,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 439 states have (on average 1.3530751708428246) internal successors, (594), 445 states have internal predecessors, (594), 188 states have call successors, (188), 10 states have call predecessors, (188), 10 states have return successors, (188), 182 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-07 07:03:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 970 transitions. [2024-11-07 07:03:45,780 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 970 transitions. Word has length 176 [2024-11-07 07:03:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:45,781 INFO L471 AbstractCegarLoop]: Abstraction has 638 states and 970 transitions. [2024-11-07 07:03:45,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 970 transitions. [2024-11-07 07:03:45,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 07:03:45,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:45,786 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:45,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:03:45,787 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:45,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:45,787 INFO L85 PathProgramCache]: Analyzing trace with hash -112433918, now seen corresponding path program 1 times [2024-11-07 07:03:45,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:45,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752419716] [2024-11-07 07:03:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:46,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:46,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:46,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:46,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:46,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:46,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:46,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:46,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:46,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:46,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:46,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:46,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:03:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752419716] [2024-11-07 07:03:46,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752419716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:03:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:03:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:03:46,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220997721] [2024-11-07 07:03:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:03:46,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:03:46,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:46,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:03:46,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:03:46,247 INFO L87 Difference]: Start difference. First operand 638 states and 970 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:46,882 INFO L93 Difference]: Finished difference Result 1866 states and 2766 transitions. [2024-11-07 07:03:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:03:46,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-11-07 07:03:46,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:46,894 INFO L225 Difference]: With dead ends: 1866 [2024-11-07 07:03:46,894 INFO L226 Difference]: Without dead ends: 1231 [2024-11-07 07:03:46,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:03:46,898 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 118 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:46,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 529 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 07:03:46,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-07 07:03:47,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 968. [2024-11-07 07:03:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 669 states have (on average 1.3064275037369208) internal successors, (874), 685 states have internal predecessors, (874), 278 states have call successors, (278), 20 states have call predecessors, (278), 20 states have return successors, (278), 262 states have call predecessors, (278), 278 states have call successors, (278) [2024-11-07 07:03:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1430 transitions. [2024-11-07 07:03:47,113 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1430 transitions. Word has length 176 [2024-11-07 07:03:47,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:47,113 INFO L471 AbstractCegarLoop]: Abstraction has 968 states and 1430 transitions. [2024-11-07 07:03:47,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:03:47,114 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1430 transitions. [2024-11-07 07:03:47,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 07:03:47,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:47,117 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:47,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:03:47,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:47,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:47,118 INFO L85 PathProgramCache]: Analyzing trace with hash -110586876, now seen corresponding path program 1 times [2024-11-07 07:03:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:47,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352887485] [2024-11-07 07:03:47,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:47,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:03:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:03:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-07 07:03:47,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:03:47,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-07 07:03:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:03:47,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-07 07:03:47,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:03:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:03:47,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:03:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:03:47,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 07:03:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 07:03:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 07:03:47,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 07:03:47,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 07:03:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 07:03:47,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 07:03:47,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 07:03:47,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 07:03:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 07:03:47,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 07:03:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 07:03:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 07:03:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-07 07:03:47,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-07 07:03:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 07:03:47,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:03:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352887485] [2024-11-07 07:03:47,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352887485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:03:47,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358473956] [2024-11-07 07:03:47,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:47,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:03:47,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:03:47,514 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 07:03:47,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 07:03:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:03:47,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 07:03:47,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:03:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-07 07:03:48,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:03:48,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 07:03:48,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358473956] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:03:48,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 07:03:48,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-07 07:03:48,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791464110] [2024-11-07 07:03:48,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 07:03:48,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:03:48,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:03:48,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:03:48,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:03:48,406 INFO L87 Difference]: Start difference. First operand 968 states and 1430 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-07 07:03:48,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:03:48,817 INFO L93 Difference]: Finished difference Result 1733 states and 2487 transitions. [2024-11-07 07:03:48,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 07:03:48,819 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 176 [2024-11-07 07:03:48,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:03:48,826 INFO L225 Difference]: With dead ends: 1733 [2024-11-07 07:03:48,826 INFO L226 Difference]: Without dead ends: 768 [2024-11-07 07:03:48,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:03:48,830 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 79 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:03:48,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 209 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:03:48,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2024-11-07 07:03:48,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 708. [2024-11-07 07:03:48,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 708 states, 489 states have (on average 1.2351738241308794) internal successors, (604), 495 states have internal predecessors, (604), 188 states have call successors, (188), 30 states have call predecessors, (188), 30 states have return successors, (188), 182 states have call predecessors, (188), 188 states have call successors, (188) [2024-11-07 07:03:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 980 transitions. [2024-11-07 07:03:48,981 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 980 transitions. Word has length 176 [2024-11-07 07:03:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:03:48,982 INFO L471 AbstractCegarLoop]: Abstraction has 708 states and 980 transitions. [2024-11-07 07:03:48,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-07 07:03:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 980 transitions. [2024-11-07 07:03:48,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-07 07:03:48,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:03:48,985 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:49,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 07:03:49,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 07:03:49,190 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:03:49,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:03:49,190 INFO L85 PathProgramCache]: Analyzing trace with hash 590477702, now seen corresponding path program 1 times [2024-11-07 07:03:49,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:03:49,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079420027] [2024-11-07 07:03:49,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:49,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:03:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:03:49,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956690853] [2024-11-07 07:03:49,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:03:49,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:03:49,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:03:49,322 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 07:03:49,325 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 07:03:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:03:49,572 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:03:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:03:49,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:03:49,817 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:03:49,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:03:49,839 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 07:03:50,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:03:50,024 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:03:50,217 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:03:50,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:03:50 BoogieIcfgContainer [2024-11-07 07:03:50,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:03:50,224 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:03:50,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:03:50,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:03:50,225 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:03:39" (3/4) ... [2024-11-07 07:03:50,227 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:03:50,228 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:03:50,229 INFO L158 Benchmark]: Toolchain (without parser) took 11497.59ms. Allocated memory was 100.7MB in the beginning and 260.0MB in the end (delta: 159.4MB). Free memory was 77.2MB in the beginning and 209.9MB in the end (delta: -132.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2024-11-07 07:03:50,230 INFO L158 Benchmark]: CDTParser took 0.91ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:03:50,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 357.51ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 61.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:03:50,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.00ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 57.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:03:50,231 INFO L158 Benchmark]: Boogie Preprocessor took 83.04ms. Allocated memory is still 100.7MB. Free memory was 57.2MB in the beginning and 50.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:03:50,231 INFO L158 Benchmark]: RCFGBuilder took 705.37ms. Allocated memory is still 100.7MB. Free memory was 50.1MB in the beginning and 68.2MB in the end (delta: -18.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. [2024-11-07 07:03:50,232 INFO L158 Benchmark]: TraceAbstraction took 10276.80ms. Allocated memory was 100.7MB in the beginning and 260.0MB in the end (delta: 159.4MB). Free memory was 67.6MB in the beginning and 210.0MB in the end (delta: -142.3MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. [2024-11-07 07:03:50,232 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 260.0MB. Free memory was 210.0MB in the beginning and 209.9MB in the end (delta: 21.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:03:50,235 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.91ms. Allocated memory is still 83.9MB. Free memory is still 48.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 357.51ms. Allocated memory is still 100.7MB. Free memory was 77.0MB in the beginning and 61.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.00ms. Allocated memory is still 100.7MB. Free memory was 61.5MB in the beginning and 57.2MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 83.04ms. Allocated memory is still 100.7MB. Free memory was 57.2MB in the beginning and 50.1MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 705.37ms. Allocated memory is still 100.7MB. Free memory was 50.1MB in the beginning and 68.2MB in the end (delta: -18.1MB). Peak memory consumption was 30.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10276.80ms. Allocated memory was 100.7MB in the beginning and 260.0MB in the end (delta: 159.4MB). Free memory was 67.6MB in the beginning and 210.0MB in the end (delta: -142.3MB). Peak memory consumption was 150.6MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 260.0MB. Free memory was 210.0MB in the beginning and 209.9MB in the end (delta: 21.1kB). 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 178, overapproximation of bitwiseOr at line 86, overapproximation of someUnaryDOUBLEoperation at line 87, overapproximation of someBinaryDOUBLEComparisonOperation at line 178. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned char var_1_31 = 0; [L42] unsigned char var_1_32 = 0; [L43] unsigned char var_1_33 = 8; [L44] unsigned long int var_1_34 = 50; [L45] double var_1_35 = 31.1; [L46] double var_1_36 = 127.4; [L47] unsigned long int var_1_37 = 64; [L48] signed long int var_1_38 = 8; [L49] float var_1_39 = 200.6; [L50] unsigned short int var_1_40 = 2; [L51] signed char var_1_42 = -4; [L52] double var_1_43 = 2.75; [L53] double var_1_44 = 7.6; [L54] signed char var_1_45 = 32; [L55] unsigned long int var_1_46 = 32; [L56] signed long int var_1_47 = -256; [L57] unsigned char last_1_var_1_9 = 1; [L58] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_9 = var_1_9 [L175] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L132] var_1_4 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L133] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L134] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L134] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L135] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=5, var_1_9=1] [L136] var_1_8 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L137] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L139] var_1_10 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L140] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L142] var_1_11 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L143] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L145] var_1_15 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L148] var_1_20 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L150] var_1_28 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L151] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L152] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L153] var_1_29 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L154] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L155] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L155] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L156] var_1_31 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L158] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L158] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=0, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L159] var_1_32 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L160] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L161] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L161] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=8, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L162] var_1_33 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L163] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L164] CALL assume_abort_if_not(var_1_33 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L164] RET assume_abort_if_not(var_1_33 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_36=637/5, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L165] var_1_36 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L166] RET assume_abort_if_not((var_1_36 >= -922337.2036854765600e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L167] var_1_39 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L168] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L169] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_44=38/5, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L170] var_1_44 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L171] RET assume_abort_if_not((var_1_44 >= -922337.2036854765600e+13F && var_1_44 <= -1.0e-20F) || (var_1_44 <= 9223372.036854765600e+12F && var_1_44 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L62] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=0, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L63] COND TRUE var_1_31 && var_1_32 [L64] var_1_30 = (((((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) < 0 ) ? -((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))) : ((((var_1_29) > (var_1_33)) ? (var_1_29) : (var_1_33))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L66] COND FALSE !(var_1_28 > var_1_30) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L71] var_1_35 = var_1_36 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L72] COND FALSE !((var_1_31 && var_1_32) && (var_1_30 > var_1_34)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L75] COND FALSE !((((((var_1_36 / var_1_39)) > (var_1_35)) ? ((var_1_36 / var_1_39)) : (var_1_35))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L80] COND TRUE var_1_27 > ((var_1_29 >> 1) + var_1_37) [L81] var_1_40 = (((((var_1_33) < 0 ) ? -(var_1_33) : (var_1_33))) + ((((var_1_29) < 0 ) ? -(var_1_29) : (var_1_29)))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L83] COND TRUE var_1_32 || var_1_31 [L84] var_1_42 = 1 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L86] EXPR var_1_42 | var_1_38 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L86] COND TRUE var_1_28 > (var_1_42 | var_1_38) [L87] var_1_43 = ((((var_1_36) > ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))))))) ? (var_1_36) : ((((((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) < 0 ) ? -((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44))) : ((((var_1_44) < 0 ) ? -(var_1_44) : (var_1_44)))))))) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=4, var_1_8=0, var_1_9=1] [L89] var_1_45 = var_1_28 [L90] var_1_46 = var_1_33 [L91] var_1_47 = var_1_30 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L92] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L99] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L101] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=1] [L102] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L103] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L105] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L106] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L109] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L111] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L112] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L115] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L119] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L120] var_1_25 = var_1_20 [L121] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=2, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=128, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L122] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L123] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L127] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=-254, var_1_15=-254, var_1_16=2, var_1_17=127/5, var_1_1=2, var_1_20=3, var_1_21=23370, var_1_24=257/2, var_1_25=3, var_1_26=2, var_1_27=-38, var_1_28=9, var_1_29=47, var_1_30=50, var_1_31=1, var_1_32=1, var_1_33=306, var_1_34=50, var_1_35=2, var_1_36=2, var_1_37=64, var_1_38=8, var_1_40=97, var_1_42=1, var_1_43=2, var_1_44=0, var_1_45=9, var_1_46=50, var_1_47=50, var_1_4=4, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 12, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1057 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1050 mSDsluCounter, 3562 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1783 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 673 IncrementalHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 1779 mSDtfsCounter, 673 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 973 GetRequests, 942 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=968occurred in iteration=10, InterpolantAutomatonStates: 46, 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, 498 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 2451 NumberOfCodeBlocks, 2451 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2262 ConstructedInterpolants, 0 QuantifiedInterpolants, 4616 SizeOfPredicates, 1 NumberOfNonLiveVariables, 428 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 13 InterpolantComputations, 10 PerfectInterpolantSequences, 16747/16900 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 07:03:50,261 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-ps-cn_file-40.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 ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:03:52,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:03:52,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 07:03:52,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:03:52,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:03:52,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:03:52,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:03:52,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:03:52,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:03:52,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:03:52,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:03:52,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:03:52,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:03:52,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:03:52,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:03:52,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:03:52,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:03:52,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:03:52,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:03:52,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:03:52,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:03:52,734 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:03:52,734 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:03:52,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:03:52,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:03:52,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:03:52,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:03:52,735 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:03:52,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:03:52,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:03:52,735 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:03:52,736 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:03:52,736 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:03:52,736 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:03:52,736 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:03:52,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:03:52,736 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 -> ff1776351702f6415e5ba3e8bd6826330be5d909403b7dc4417dfce33112b4ef [2024-11-07 07:03:53,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:03:53,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:03:53,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:03:53,040 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:03:53,040 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:03:53,043 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-ps-cn_file-40.i [2024-11-07 07:03:54,381 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:03:54,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:03:54,669 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-07 07:03:54,680 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a04a9e229/499ce6bb2497413ba75e52892abb4040/FLAGb2d6b2b83 [2024-11-07 07:03:54,699 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a04a9e229/499ce6bb2497413ba75e52892abb4040 [2024-11-07 07:03:54,702 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:03:54,703 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:03:54,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:03:54,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:03:54,709 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:03:54,710 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:03:54" (1/1) ... [2024-11-07 07:03:54,711 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434aa979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:54, skipping insertion in model container [2024-11-07 07:03:54,711 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:03:54" (1/1) ... [2024-11-07 07:03:54,730 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:03:54,879 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-ps-cn_file-40.i[919,932] [2024-11-07 07:03:54,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:03:55,001 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:03:55,014 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-ps-cn_file-40.i[919,932] [2024-11-07 07:03:55,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:03:55,089 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:03:55,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55 WrapperNode [2024-11-07 07:03:55,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:03:55,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:03:55,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:03:55,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:03:55,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,110 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,144 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-07 07:03:55,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:03:55,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:03:55,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:03:55,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:03:55,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,176 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 07:03:55,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,186 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,191 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,193 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:03:55,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:03:55,204 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:03:55,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:03:55,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (1/1) ... [2024-11-07 07:03:55,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:03:55,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:03:55,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 07:03:55,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 07:03:55,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:03:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:03:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:03:55,267 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:03:55,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:03:55,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:03:55,374 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:03:55,376 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:04:04,640 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 07:04:04,640 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:04:04,649 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:04:04,649 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:04:04,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:04:04 BoogieIcfgContainer [2024-11-07 07:04:04,649 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:04:04,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:04:04,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:04:04,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:04:04,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:03:54" (1/3) ... [2024-11-07 07:04:04,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e31ced5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:04:04, skipping insertion in model container [2024-11-07 07:04:04,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:03:55" (2/3) ... [2024-11-07 07:04:04,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e31ced5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:04:04, skipping insertion in model container [2024-11-07 07:04:04,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:04:04" (3/3) ... [2024-11-07 07:04:04,658 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-40.i [2024-11-07 07:04:04,670 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:04:04,670 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:04:04,720 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:04:04,730 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;@16b477ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:04:04,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:04:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:04:04,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 07:04:04,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:04,746 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:04:04,747 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:04,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1629278474, now seen corresponding path program 1 times [2024-11-07 07:04:04,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:04:04,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2069563741] [2024-11-07 07:04:04,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:04,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:04,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:04:04,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:04:04,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 07:04:05,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:05,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:04:05,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:04:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 746 trivial. 0 not checked. [2024-11-07 07:04:05,734 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:04:05,734 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:04:05,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2069563741] [2024-11-07 07:04:05,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2069563741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:04:05,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:04:05,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:04:05,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645381316] [2024-11-07 07:04:05,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:04:05,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:04:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:04:05,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:04:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:04:05,791 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 55 states have internal predecessors, (77), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 07:04:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:05,817 INFO L93 Difference]: Finished difference Result 159 states and 278 transitions. [2024-11-07 07:04:05,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:04:05,819 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 172 [2024-11-07 07:04:05,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:05,824 INFO L225 Difference]: With dead ends: 159 [2024-11-07 07:04:05,824 INFO L226 Difference]: Without dead ends: 79 [2024-11-07 07:04:05,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:04:05,829 INFO L432 NwaCegarLoop]: 121 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, 121 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:04:05,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:04:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-07 07:04:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-07 07:04:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 51 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:04:05,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2024-11-07 07:04:05,879 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 172 [2024-11-07 07:04:05,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:05,879 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2024-11-07 07:04:05,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-07 07:04:05,880 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2024-11-07 07:04:05,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 07:04:05,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:05,882 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:04:05,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 07:04:06,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:06,083 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:06,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:06,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1244735805, now seen corresponding path program 1 times [2024-11-07 07:04:06,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:04:06,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [798670075] [2024-11-07 07:04:06,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:06,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:06,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:04:06,088 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:04:06,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 07:04:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:07,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 07:04:07,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:04:09,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 585 proven. 51 refuted. 0 times theorem prover too weak. 664 trivial. 0 not checked. [2024-11-07 07:04:09,946 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:04:12,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 24 proven. 51 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-11-07 07:04:12,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:04:12,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [798670075] [2024-11-07 07:04:12,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [798670075] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 07:04:12,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:04:12,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 07:04:12,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680806109] [2024-11-07 07:04:12,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:04:12,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 07:04:12,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:04:12,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 07:04:12,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:04:12,628 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-07 07:04:17,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:17,927 INFO L93 Difference]: Finished difference Result 243 states and 363 transitions. [2024-11-07 07:04:17,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 07:04:17,928 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 173 [2024-11-07 07:04:17,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:17,930 INFO L225 Difference]: With dead ends: 243 [2024-11-07 07:04:17,930 INFO L226 Difference]: Without dead ends: 167 [2024-11-07 07:04:17,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-07 07:04:17,934 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 129 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:04:17,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 416 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-07 07:04:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-07 07:04:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 81. [2024-11-07 07:04:17,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 52 states have internal predecessors, (66), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:04:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 118 transitions. [2024-11-07 07:04:17,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 118 transitions. Word has length 173 [2024-11-07 07:04:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:17,966 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 118 transitions. [2024-11-07 07:04:17,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 2 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2024-11-07 07:04:17,967 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 118 transitions. [2024-11-07 07:04:17,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 07:04:17,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:17,969 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:04:17,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 07:04:18,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:18,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:18,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:18,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1945800383, now seen corresponding path program 1 times [2024-11-07 07:04:18,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:04:18,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897955788] [2024-11-07 07:04:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:04:18,173 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:04:18,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 07:04:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:18,994 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:04:19,009 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:04:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:04:19,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:04:19,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:04:19,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897955788] [2024-11-07 07:04:19,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897955788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:04:19,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:04:19,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:04:19,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664845247] [2024-11-07 07:04:19,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:04:19,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:04:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:04:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:04:19,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:04:19,113 INFO L87 Difference]: Start difference. First operand 81 states and 118 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:04:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:19,347 INFO L93 Difference]: Finished difference Result 159 states and 233 transitions. [2024-11-07 07:04:19,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:04:19,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-07 07:04:19,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:19,364 INFO L225 Difference]: With dead ends: 159 [2024-11-07 07:04:19,364 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 07:04:19,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:04:19,365 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:04:19,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:04:19,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 07:04:19,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 07:04:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.25) internal successors, (65), 52 states have internal predecessors, (65), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 07:04:19,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-11-07 07:04:19,378 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 173 [2024-11-07 07:04:19,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:19,379 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-11-07 07:04:19,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:04:19,379 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-11-07 07:04:19,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 07:04:19,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:19,382 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:04:19,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 07:04:19,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:19,583 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:19,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1136453757, now seen corresponding path program 1 times [2024-11-07 07:04:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:04:19,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [825087848] [2024-11-07 07:04:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:19,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:19,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:04:19,589 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:04:19,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 07:04:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:20,411 INFO L255 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 07:04:20,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:04:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-07 07:04:21,064 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:04:21,064 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:04:21,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [825087848] [2024-11-07 07:04:21,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [825087848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:04:21,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:04:21,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:04:21,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599363673] [2024-11-07 07:04:21,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:04:21,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:04:21,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:04:21,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:04:21,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:04:21,066 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:04:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:04:23,743 INFO L93 Difference]: Finished difference Result 298 states and 435 transitions. [2024-11-07 07:04:23,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 07:04:23,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 173 [2024-11-07 07:04:23,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:04:23,750 INFO L225 Difference]: With dead ends: 298 [2024-11-07 07:04:23,750 INFO L226 Difference]: Without dead ends: 220 [2024-11-07 07:04:23,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:04:23,751 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 203 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 07:04:23,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 554 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 07:04:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-07 07:04:23,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 135. [2024-11-07 07:04:23,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 77 states have (on average 1.1688311688311688) internal successors, (90), 78 states have internal predecessors, (90), 52 states have call successors, (52), 5 states have call predecessors, (52), 5 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-07 07:04:23,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 194 transitions. [2024-11-07 07:04:23,786 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 194 transitions. Word has length 173 [2024-11-07 07:04:23,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:04:23,787 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 194 transitions. [2024-11-07 07:04:23,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-07 07:04:23,787 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 194 transitions. [2024-11-07 07:04:23,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 07:04:23,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:04:23,789 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:04:23,820 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 (5)] Ended with exit code 0 [2024-11-07 07:04:23,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:23,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:04:23,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:04:23,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1138300799, now seen corresponding path program 1 times [2024-11-07 07:04:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:04:23,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229988810] [2024-11-07 07:04:23,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:04:23,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 07:04:23,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:04:23,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 07:04:23,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 07:04:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:04:24,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-07 07:04:24,817 INFO L278 TraceCheckSpWp]: Computing forward predicates...