./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.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-co_file-84.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', '923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0'] 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-co_file-84.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 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:19:57,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:19:57,543 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:19:57,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:19:57,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:19:57,577 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:19:57,578 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:19:57,578 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:19:57,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:19:57,580 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:19:57,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:19:57,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:19:57,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:19:57,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:19:57,581 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:19:57,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:19:57,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:19:57,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:19:57,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 07:19:57,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:19:57,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:19:57,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:19:57,582 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:19:57,582 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:19:57,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:19:57,583 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:19:57,583 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:19:57,583 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:19:57,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:19:57,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:19:57,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:19:57,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:19:57,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:19:57,584 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:19:57,584 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 -> 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 [2024-11-07 07:19:57,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:19:57,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:19:57,868 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:19:57,869 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:19:57,869 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:19:57,870 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-co_file-84.i [2024-11-07 07:19:59,173 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:19:59,423 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:19:59,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-07 07:19:59,430 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00653f1c6/3eb536f608f54f2a80459b9b02c04666/FLAG258daa944 [2024-11-07 07:19:59,444 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/00653f1c6/3eb536f608f54f2a80459b9b02c04666 [2024-11-07 07:19:59,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:19:59,447 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:19:59,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:19:59,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:19:59,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:19:59,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,454 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5103e3af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59, skipping insertion in model container [2024-11-07 07:19:59,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,476 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:19:59,599 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-co_file-84.i[919,932] [2024-11-07 07:19:59,670 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:19:59,680 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:19:59,688 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-co_file-84.i[919,932] [2024-11-07 07:19:59,737 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:19:59,757 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:19:59,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59 WrapperNode [2024-11-07 07:19:59,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:19:59,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:19:59,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:19:59,762 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:19:59,767 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:19:59" (1/1) ... [2024-11-07 07:19:59,783 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:19:59" (1/1) ... [2024-11-07 07:19:59,838 INFO L138 Inliner]: procedures = 26, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 274 [2024-11-07 07:19:59,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:19:59,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:19:59,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:19:59,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:19:59,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,855 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,882 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:19:59,885 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,885 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,911 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,918 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:19:59,919 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:19:59,919 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:19:59,920 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:19:59,920 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (1/1) ... [2024-11-07 07:19:59,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:19:59,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:19:59,955 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:19:59,961 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:19:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:19:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:19:59,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:19:59,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 07:19:59,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:19:59,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:20:00,068 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:20:00,069 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:20:00,678 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-07 07:20:00,680 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:20:00,695 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:20:00,695 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:20:00,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:00 BoogieIcfgContainer [2024-11-07 07:20:00,695 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:20:00,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:20:00,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:20:00,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:20:00,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:19:59" (1/3) ... [2024-11-07 07:20:00,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f262c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:00, skipping insertion in model container [2024-11-07 07:20:00,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:19:59" (2/3) ... [2024-11-07 07:20:00,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f262c3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:20:00, skipping insertion in model container [2024-11-07 07:20:00,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:00" (3/3) ... [2024-11-07 07:20:00,702 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-07 07:20:00,716 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:20:00,717 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:20:00,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:20:00,775 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;@5fe25cba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:20:00,775 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:20:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:20:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-07 07:20:00,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:00,793 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:00,793 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash -2095802463, now seen corresponding path program 1 times [2024-11-07 07:20:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:00,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868090443] [2024-11-07 07:20:00,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:01,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:01,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:01,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:01,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:01,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:01,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:01,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868090443] [2024-11-07 07:20:01,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868090443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:01,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:01,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:20:01,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445757984] [2024-11-07 07:20:01,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:01,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:20:01,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:01,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:20:01,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:20:01,460 INFO L87 Difference]: Start difference. First operand has 122 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 80 states have internal predecessors, (114), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:20:01,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:01,491 INFO L93 Difference]: Finished difference Result 237 states and 422 transitions. [2024-11-07 07:20:01,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:20:01,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) Word has length 253 [2024-11-07 07:20:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:01,499 INFO L225 Difference]: With dead ends: 237 [2024-11-07 07:20:01,499 INFO L226 Difference]: Without dead ends: 118 [2024-11-07 07:20:01,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 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:20:01,505 INFO L432 NwaCegarLoop]: 187 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, 187 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:20:01,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:20:01,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-07 07:20:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-11-07 07:20:01,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.4078947368421053) internal successors, (107), 76 states have internal predecessors, (107), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:20:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2024-11-07 07:20:01,553 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 253 [2024-11-07 07:20:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:01,554 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2024-11-07 07:20:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:20:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2024-11-07 07:20:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2024-11-07 07:20:01,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:01,560 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:01,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 07:20:01,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:01,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash 2003280297, now seen corresponding path program 1 times [2024-11-07 07:20:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851805212] [2024-11-07 07:20:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:01,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:01,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:01,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:01,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:01,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:01,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:01,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:01,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:02,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:02,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:02,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:02,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851805212] [2024-11-07 07:20:02,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851805212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:02,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:02,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:20:02,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532049976] [2024-11-07 07:20:02,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:02,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:20:02,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:02,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:20:02,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:20:02,052 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:02,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:02,113 INFO L93 Difference]: Finished difference Result 230 states and 365 transitions. [2024-11-07 07:20:02,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:20:02,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 253 [2024-11-07 07:20:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:02,122 INFO L225 Difference]: With dead ends: 230 [2024-11-07 07:20:02,122 INFO L226 Difference]: Without dead ends: 115 [2024-11-07 07:20:02,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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:20:02,126 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 168 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:02,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 171 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:20:02,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-07 07:20:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-11-07 07:20:02,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 73 states have (on average 1.3287671232876712) internal successors, (97), 73 states have internal predecessors, (97), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:20:02,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 177 transitions. [2024-11-07 07:20:02,152 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 177 transitions. Word has length 253 [2024-11-07 07:20:02,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:02,154 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 177 transitions. [2024-11-07 07:20:02,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 177 transitions. [2024-11-07 07:20:02,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-11-07 07:20:02,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:02,161 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:02,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 07:20:02,163 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:02,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:02,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1690157102, now seen corresponding path program 1 times [2024-11-07 07:20:02,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:02,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062365575] [2024-11-07 07:20:02,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:02,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:06,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:06,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:06,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:06,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:06,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:06,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:06,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:06,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:06,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:06,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:06,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:06,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:06,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062365575] [2024-11-07 07:20:06,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062365575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:06,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:06,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 07:20:06,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691586003] [2024-11-07 07:20:06,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:06,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 07:20:06,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:06,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 07:20:06,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 07:20:06,853 INFO L87 Difference]: Start difference. First operand 115 states and 177 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:09,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:09,689 INFO L93 Difference]: Finished difference Result 411 states and 594 transitions. [2024-11-07 07:20:09,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:20:09,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 254 [2024-11-07 07:20:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:09,698 INFO L225 Difference]: With dead ends: 411 [2024-11-07 07:20:09,699 INFO L226 Difference]: Without dead ends: 299 [2024-11-07 07:20:09,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:20:09,700 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 374 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:09,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 828 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 07:20:09,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-07 07:20:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 167. [2024-11-07 07:20:09,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 122 states have (on average 1.3770491803278688) internal successors, (168), 123 states have internal predecessors, (168), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 07:20:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 252 transitions. [2024-11-07 07:20:09,742 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 252 transitions. Word has length 254 [2024-11-07 07:20:09,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:09,744 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 252 transitions. [2024-11-07 07:20:09,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:09,744 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2024-11-07 07:20:09,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 07:20:09,748 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:09,748 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:09,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 07:20:09,749 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:09,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:09,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1871446265, now seen corresponding path program 1 times [2024-11-07 07:20:09,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:09,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686796734] [2024-11-07 07:20:09,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:09,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:17,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:17,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:17,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:17,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:17,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:17,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:18,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:18,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:18,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:18,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686796734] [2024-11-07 07:20:18,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686796734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:18,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:18,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 07:20:18,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622844927] [2024-11-07 07:20:18,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:18,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 07:20:18,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:18,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 07:20:18,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:20:18,355 INFO L87 Difference]: Start difference. First operand 167 states and 252 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:20:24,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:24,787 INFO L93 Difference]: Finished difference Result 521 states and 752 transitions. [2024-11-07 07:20:24,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:20:24,789 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 255 [2024-11-07 07:20:24,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:24,793 INFO L225 Difference]: With dead ends: 521 [2024-11-07 07:20:24,793 INFO L226 Difference]: Without dead ends: 357 [2024-11-07 07:20:24,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=141, Invalid=279, Unknown=0, NotChecked=0, Total=420 [2024-11-07 07:20:24,796 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 703 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:24,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 673 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-07 07:20:24,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-11-07 07:20:24,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 176. [2024-11-07 07:20:24,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 131 states have (on average 1.3893129770992367) internal successors, (182), 132 states have internal predecessors, (182), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-07 07:20:24,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 266 transitions. [2024-11-07 07:20:24,834 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 266 transitions. Word has length 255 [2024-11-07 07:20:24,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:24,836 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 266 transitions. [2024-11-07 07:20:24,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 2 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:20:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 266 transitions. [2024-11-07 07:20:24,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 07:20:24,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:24,840 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:24,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 07:20:24,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:24,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1722456453, now seen corresponding path program 1 times [2024-11-07 07:20:24,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:24,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166992663] [2024-11-07 07:20:24,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:24,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:26,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:26,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:26,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:26,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:26,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:26,534 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:26,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:26,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166992663] [2024-11-07 07:20:26,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166992663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:26,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:26,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:20:26,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748602973] [2024-11-07 07:20:26,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:26,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:20:26,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:26,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:20:26,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:20:26,538 INFO L87 Difference]: Start difference. First operand 176 states and 266 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:27,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:27,423 INFO L93 Difference]: Finished difference Result 420 states and 623 transitions. [2024-11-07 07:20:27,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:20:27,427 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2024-11-07 07:20:27,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:27,429 INFO L225 Difference]: With dead ends: 420 [2024-11-07 07:20:27,432 INFO L226 Difference]: Without dead ends: 247 [2024-11-07 07:20:27,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:20:27,433 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 41 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:27,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 745 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 07:20:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-07 07:20:27,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 222. [2024-11-07 07:20:27,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 172 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 07:20:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2024-11-07 07:20:27,469 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 255 [2024-11-07 07:20:27,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:27,469 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2024-11-07 07:20:27,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2024-11-07 07:20:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 07:20:27,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:27,473 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:27,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 07:20:27,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:27,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:27,473 INFO L85 PathProgramCache]: Analyzing trace with hash -610877799, now seen corresponding path program 1 times [2024-11-07 07:20:27,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:27,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081642442] [2024-11-07 07:20:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:31,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:31,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:31,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:31,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:31,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:31,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:31,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:31,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:31,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:31,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081642442] [2024-11-07 07:20:31,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081642442] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:31,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:31,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 07:20:31,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819120690] [2024-11-07 07:20:31,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:31,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 07:20:31,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:31,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 07:20:31,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:20:31,226 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:32,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:32,401 INFO L93 Difference]: Finished difference Result 479 states and 690 transitions. [2024-11-07 07:20:32,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:20:32,402 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), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2024-11-07 07:20:32,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:32,404 INFO L225 Difference]: With dead ends: 479 [2024-11-07 07:20:32,404 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 07:20:32,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-07 07:20:32,406 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 44 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:32,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 873 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 07:20:32,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 07:20:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 222. [2024-11-07 07:20:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 169 states have (on average 1.3431952662721893) internal successors, (227), 172 states have internal predecessors, (227), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-07 07:20:32,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 323 transitions. [2024-11-07 07:20:32,428 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 323 transitions. Word has length 255 [2024-11-07 07:20:32,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:32,429 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 323 transitions. [2024-11-07 07:20:32,429 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), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:32,429 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 323 transitions. [2024-11-07 07:20:32,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2024-11-07 07:20:32,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:32,432 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:32,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 07:20:32,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:32,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:32,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1971907669, now seen corresponding path program 1 times [2024-11-07 07:20:32,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:32,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24582554] [2024-11-07 07:20:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:32,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:32,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:32,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:32,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:32,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:32,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:32,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24582554] [2024-11-07 07:20:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24582554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:32,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:32,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 07:20:32,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105632040] [2024-11-07 07:20:32,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:32,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 07:20:32,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:32,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 07:20:32,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 07:20:32,982 INFO L87 Difference]: Start difference. First operand 222 states and 323 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:33,192 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2024-11-07 07:20:33,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 07:20:33,193 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 255 [2024-11-07 07:20:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:33,195 INFO L225 Difference]: With dead ends: 479 [2024-11-07 07:20:33,195 INFO L226 Difference]: Without dead ends: 260 [2024-11-07 07:20:33,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:20:33,199 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 72 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:33,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 679 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:20:33,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-07 07:20:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 189. [2024-11-07 07:20:33,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 138 states have (on average 1.326086956521739) internal successors, (183), 140 states have internal predecessors, (183), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 07:20:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 275 transitions. [2024-11-07 07:20:33,227 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 275 transitions. Word has length 255 [2024-11-07 07:20:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:33,228 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 275 transitions. [2024-11-07 07:20:33,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 275 transitions. [2024-11-07 07:20:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 07:20:33,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:33,230 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:33,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 07:20:33,230 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:33,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -952498931, now seen corresponding path program 1 times [2024-11-07 07:20:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:33,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104814269] [2024-11-07 07:20:33,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:33,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:33,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:36,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:36,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:36,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:36,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:36,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:36,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:36,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:36,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:36,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104814269] [2024-11-07 07:20:36,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104814269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:36,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:36,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 07:20:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091103838] [2024-11-07 07:20:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:36,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:20:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:36,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:20:36,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:20:36,217 INFO L87 Difference]: Start difference. First operand 189 states and 275 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:37,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:37,069 INFO L93 Difference]: Finished difference Result 472 states and 677 transitions. [2024-11-07 07:20:37,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:20:37,070 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2024-11-07 07:20:37,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:37,074 INFO L225 Difference]: With dead ends: 472 [2024-11-07 07:20:37,074 INFO L226 Difference]: Without dead ends: 286 [2024-11-07 07:20:37,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2024-11-07 07:20:37,075 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 118 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:37,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1081 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 07:20:37,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-07 07:20:37,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 219. [2024-11-07 07:20:37,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 168 states have (on average 1.3333333333333333) internal successors, (224), 170 states have internal predecessors, (224), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 07:20:37,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-07 07:20:37,098 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 256 [2024-11-07 07:20:37,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:37,099 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-07 07:20:37,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:37,099 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-07 07:20:37,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 07:20:37,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:37,101 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:37,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 07:20:37,102 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:37,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:37,102 INFO L85 PathProgramCache]: Analyzing trace with hash -251434353, now seen corresponding path program 1 times [2024-11-07 07:20:37,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:37,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367049830] [2024-11-07 07:20:37,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:37,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:40,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:40,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:40,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:40,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:40,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:40,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:40,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:40,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:40,755 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:40,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:40,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367049830] [2024-11-07 07:20:40,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367049830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:40,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:40,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 07:20:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232721816] [2024-11-07 07:20:40,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:40,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 07:20:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 07:20:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-07 07:20:40,760 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:42,000 INFO L93 Difference]: Finished difference Result 517 states and 737 transitions. [2024-11-07 07:20:42,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:20:42,002 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2024-11-07 07:20:42,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:42,004 INFO L225 Difference]: With dead ends: 517 [2024-11-07 07:20:42,004 INFO L226 Difference]: Without dead ends: 301 [2024-11-07 07:20:42,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-07 07:20:42,006 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 331 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:42,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 541 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 07:20:42,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-07 07:20:42,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 223. [2024-11-07 07:20:42,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 172 states have (on average 1.3372093023255813) internal successors, (230), 174 states have internal predecessors, (230), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 07:20:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 322 transitions. [2024-11-07 07:20:42,033 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 322 transitions. Word has length 256 [2024-11-07 07:20:42,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:42,034 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 322 transitions. [2024-11-07 07:20:42,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.538461538461538) internal successors, (59), 13 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:42,034 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 322 transitions. [2024-11-07 07:20:42,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-07 07:20:42,036 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:42,036 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:42,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 07:20:42,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:42,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:42,037 INFO L85 PathProgramCache]: Analyzing trace with hash -838240367, now seen corresponding path program 1 times [2024-11-07 07:20:42,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:42,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739741674] [2024-11-07 07:20:42,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:42,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:44,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:44,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:44,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:44,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:44,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:44,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:44,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:44,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:44,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:44,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:44,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:44,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739741674] [2024-11-07 07:20:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739741674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:44,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:44,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 07:20:44,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391931453] [2024-11-07 07:20:44,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:44,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:20:44,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:44,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:20:44,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-07 07:20:44,811 INFO L87 Difference]: Start difference. First operand 223 states and 322 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:46,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:46,197 INFO L93 Difference]: Finished difference Result 515 states and 735 transitions. [2024-11-07 07:20:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 07:20:46,198 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 256 [2024-11-07 07:20:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:46,201 INFO L225 Difference]: With dead ends: 515 [2024-11-07 07:20:46,201 INFO L226 Difference]: Without dead ends: 295 [2024-11-07 07:20:46,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2024-11-07 07:20:46,203 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 121 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1248 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:46,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1248 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 07:20:46,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-07 07:20:46,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 219. [2024-11-07 07:20:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 168 states have (on average 1.3333333333333333) internal successors, (224), 170 states have internal predecessors, (224), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-07 07:20:46,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-07 07:20:46,229 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 256 [2024-11-07 07:20:46,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:46,230 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-07 07:20:46,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:46,230 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-07 07:20:46,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-07 07:20:46,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:46,232 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:46,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 07:20:46,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:46,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:46,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1340598156, now seen corresponding path program 1 times [2024-11-07 07:20:46,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:46,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837563586] [2024-11-07 07:20:46,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:46,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:46,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:46,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:46,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:46,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:46,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:46,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:46,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:46,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:46,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:46,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:46,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:46,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:46,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:46,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:46,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:46,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:46,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837563586] [2024-11-07 07:20:46,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837563586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:46,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:46,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 07:20:46,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644248316] [2024-11-07 07:20:46,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:46,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 07:20:46,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:46,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 07:20:46,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 07:20:46,520 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:46,789 INFO L93 Difference]: Finished difference Result 623 states and 901 transitions. [2024-11-07 07:20:46,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 07:20:46,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2024-11-07 07:20:46,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:46,794 INFO L225 Difference]: With dead ends: 623 [2024-11-07 07:20:46,794 INFO L226 Difference]: Without dead ends: 407 [2024-11-07 07:20:46,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 07:20:46,797 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 121 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:46,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 592 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 07:20:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-11-07 07:20:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 305. [2024-11-07 07:20:46,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 211 states have (on average 1.2985781990521328) internal successors, (274), 213 states have internal predecessors, (274), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-07 07:20:46,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 446 transitions. [2024-11-07 07:20:46,849 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 446 transitions. Word has length 257 [2024-11-07 07:20:46,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:46,850 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 446 transitions. [2024-11-07 07:20:46,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 446 transitions. [2024-11-07 07:20:46,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-07 07:20:46,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:46,854 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:46,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 07:20:46,854 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:46,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1320964054, now seen corresponding path program 1 times [2024-11-07 07:20:46,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:46,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959697789] [2024-11-07 07:20:46,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:46,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:46,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:46,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:46,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:46,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:46,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:46,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:46,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959697789] [2024-11-07 07:20:46,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959697789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:46,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:46,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:20:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94136937] [2024-11-07 07:20:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:46,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:20:46,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:46,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:20:46,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:20:46,986 INFO L87 Difference]: Start difference. First operand 305 states and 446 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:47,103 INFO L93 Difference]: Finished difference Result 551 states and 796 transitions. [2024-11-07 07:20:47,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:20:47,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2024-11-07 07:20:47,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:47,107 INFO L225 Difference]: With dead ends: 551 [2024-11-07 07:20:47,107 INFO L226 Difference]: Without dead ends: 335 [2024-11-07 07:20:47,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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:20:47,108 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 39 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:47,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 300 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:20:47,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2024-11-07 07:20:47,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 312. [2024-11-07 07:20:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 218 states have (on average 1.2844036697247707) internal successors, (280), 220 states have internal predecessors, (280), 86 states have call successors, (86), 7 states have call predecessors, (86), 7 states have return successors, (86), 84 states have call predecessors, (86), 86 states have call successors, (86) [2024-11-07 07:20:47,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 452 transitions. [2024-11-07 07:20:47,152 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 452 transitions. Word has length 257 [2024-11-07 07:20:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:47,153 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 452 transitions. [2024-11-07 07:20:47,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 452 transitions. [2024-11-07 07:20:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-07 07:20:47,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:47,155 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 07:20:47,155 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:47,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:47,155 INFO L85 PathProgramCache]: Analyzing trace with hash -707789790, now seen corresponding path program 1 times [2024-11-07 07:20:47,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:47,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003655286] [2024-11-07 07:20:47,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:47,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:47,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:47,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:47,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:47,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:47,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:47,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:47,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:47,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:47,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:47,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:47,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:47,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:47,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:20:47,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:47,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003655286] [2024-11-07 07:20:47,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003655286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:20:47,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:20:47,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:20:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503447599] [2024-11-07 07:20:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:20:47,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:20:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:47,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:20:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:20:47,276 INFO L87 Difference]: Start difference. First operand 312 states and 452 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:47,411 INFO L93 Difference]: Finished difference Result 562 states and 801 transitions. [2024-11-07 07:20:47,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:20:47,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 257 [2024-11-07 07:20:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:47,415 INFO L225 Difference]: With dead ends: 562 [2024-11-07 07:20:47,418 INFO L226 Difference]: Without dead ends: 339 [2024-11-07 07:20:47,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 82 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:20:47,420 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 46 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:47,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 317 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:20:47,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2024-11-07 07:20:47,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 297. [2024-11-07 07:20:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 205 states have (on average 1.273170731707317) internal successors, (261), 206 states have internal predecessors, (261), 84 states have call successors, (84), 7 states have call predecessors, (84), 7 states have return successors, (84), 83 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-07 07:20:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 429 transitions. [2024-11-07 07:20:47,464 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 429 transitions. Word has length 257 [2024-11-07 07:20:47,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:47,465 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 429 transitions. [2024-11-07 07:20:47,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:20:47,465 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 429 transitions. [2024-11-07 07:20:47,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 07:20:47,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:47,467 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:47,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 07:20:47,467 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:47,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:47,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1357586360, now seen corresponding path program 1 times [2024-11-07 07:20:47,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:47,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474782335] [2024-11-07 07:20:47,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:47,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 07:20:47,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 07:20:47,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 07:20:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 07:20:47,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 07:20:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 07:20:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 07:20:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 07:20:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 07:20:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 07:20:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 07:20:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-07 07:20:47,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 07:20:47,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-07 07:20:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-07 07:20:47,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-07 07:20:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-07 07:20:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-07 07:20:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-07 07:20:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-07 07:20:47,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-07 07:20:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-07 07:20:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-07 07:20:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-07 07:20:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-07 07:20:47,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-07 07:20:47,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-07 07:20:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-07 07:20:47,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-11-07 07:20:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-11-07 07:20:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2024-11-07 07:20:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:47,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-11-07 07:20:47,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-11-07 07:20:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-11-07 07:20:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-11-07 07:20:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-11-07 07:20:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2024-11-07 07:20:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-11-07 07:20:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-11-07 07:20:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-11-07 07:20:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 192 proven. 36 refuted. 0 times theorem prover too weak. 2892 trivial. 0 not checked. [2024-11-07 07:20:48,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 07:20:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474782335] [2024-11-07 07:20:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474782335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:20:48,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427657486] [2024-11-07 07:20:48,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:48,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:20:48,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:20:48,049 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:20:48,050 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:20:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:20:48,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 575 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-07 07:20:48,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:20:48,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1147 proven. 36 refuted. 0 times theorem prover too weak. 1937 trivial. 0 not checked. [2024-11-07 07:20:48,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 07:20:54,053 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_~var_1_34~0 256))) (let ((.cse0 (< 0 c_~var_1_13~0)) (.cse1 (+ (- 128) .cse5)) (.cse4 (< .cse5 128))) (and (or .cse0 (forall ((~var_1_36~0 Int)) (or (< ~var_1_36~0 c_~var_1_13~0) (not (= (mod .cse1 ~var_1_36~0) 0)) (= ~var_1_36~0 0)))) (forall ((~var_1_36~0 Int)) (let ((.cse2 (mod .cse1 ~var_1_36~0))) (or (< (+ .cse2 ~var_1_36~0) c_~var_1_13~0) (= ~var_1_36~0 0) (< .cse2 (+ c_~var_1_13~0 ~var_1_36~0))))) (or .cse0 (forall ((~var_1_36~0 Int)) (or (not (= (mod .cse1 ~var_1_36~0) 0)) (= ~var_1_36~0 0)))) (or (forall ((~var_1_36~0 Int)) (let ((.cse3 (mod .cse1 ~var_1_36~0))) (or (< (+ .cse3 ~var_1_36~0) c_~var_1_13~0) (< .cse3 c_~var_1_13~0) (= ~var_1_36~0 0)))) .cse4) (or (forall ((~var_1_36~0 Int)) (or (< (mod .cse1 ~var_1_36~0) c_~var_1_13~0) (= ~var_1_36~0 0))) .cse4)))) is different from false [2024-11-07 07:20:54,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427657486] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 07:20:54,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 07:20:54,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2024-11-07 07:20:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613411379] [2024-11-07 07:20:54,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 07:20:54,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 07:20:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 07:20:54,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 07:20:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=96, Unknown=1, NotChecked=20, Total=156 [2024-11-07 07:20:54,077 INFO L87 Difference]: Start difference. First operand 297 states and 429 transitions. Second operand has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (80), 4 states have call predecessors, (80), 7 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2024-11-07 07:20:55,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:20:55,192 INFO L93 Difference]: Finished difference Result 741 states and 1046 transitions. [2024-11-07 07:20:55,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 07:20:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (80), 4 states have call predecessors, (80), 7 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) Word has length 258 [2024-11-07 07:20:55,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:20:55,198 INFO L225 Difference]: With dead ends: 741 [2024-11-07 07:20:55,198 INFO L226 Difference]: Without dead ends: 531 [2024-11-07 07:20:55,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=85, Invalid=190, Unknown=1, NotChecked=30, Total=306 [2024-11-07 07:20:55,200 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 184 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 07:20:55,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 821 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 07:20:55,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2024-11-07 07:20:55,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 519. [2024-11-07 07:20:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 375 states have (on average 1.2746666666666666) internal successors, (478), 377 states have internal predecessors, (478), 128 states have call successors, (128), 15 states have call predecessors, (128), 15 states have return successors, (128), 126 states have call predecessors, (128), 128 states have call successors, (128) [2024-11-07 07:20:55,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 734 transitions. [2024-11-07 07:20:55,284 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 734 transitions. Word has length 258 [2024-11-07 07:20:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:20:55,285 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 734 transitions. [2024-11-07 07:20:55,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.181818181818182) internal successors, (79), 11 states have internal predecessors, (79), 3 states have call successors, (80), 4 states have call predecessors, (80), 7 states have return successors, (80), 3 states have call predecessors, (80), 3 states have call successors, (80) [2024-11-07 07:20:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 734 transitions. [2024-11-07 07:20:55,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-07 07:20:55,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:20:55,287 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20:55,301 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:20:55,488 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,SelfDestructingSolverStorable13 [2024-11-07 07:20:55,489 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:20:55,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:20:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1217037750, now seen corresponding path program 1 times [2024-11-07 07:20:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 07:20:55,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805236743] [2024-11-07 07:20:55,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 07:20:55,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 07:20:55,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100069152] [2024-11-07 07:20:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:20:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 07:20:55,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:20:55,600 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:20:55,602 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:20:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:20:55,816 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 07:20:55,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 07:20:56,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 07:20:56,155 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 07:20:56,157 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 07:20:56,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:20:56,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-07 07:20:56,362 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 07:20:56,526 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 07:20:56,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 07:20:56 BoogieIcfgContainer [2024-11-07 07:20:56,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 07:20:56,531 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 07:20:56,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 07:20:56,532 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 07:20:56,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:20:00" (3/4) ... [2024-11-07 07:20:56,534 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 07:20:56,536 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 07:20:56,537 INFO L158 Benchmark]: Toolchain (without parser) took 57089.47ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 91.8MB in the beginning and 406.8MB in the end (delta: -315.1MB). Peak memory consumption was 158.6MB. Max. memory is 16.1GB. [2024-11-07 07:20:56,538 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:20:56,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.29ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 75.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 07:20:56,538 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.48ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 70.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:20:56,538 INFO L158 Benchmark]: Boogie Preprocessor took 79.27ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 07:20:56,538 INFO L158 Benchmark]: RCFGBuilder took 776.10ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 76.4MB in the end (delta: -11.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. [2024-11-07 07:20:56,539 INFO L158 Benchmark]: TraceAbstraction took 55834.06ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 76.0MB in the beginning and 407.0MB in the end (delta: -331.0MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. [2024-11-07 07:20:56,539 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 587.2MB. Free memory was 407.0MB in the beginning and 406.8MB in the end (delta: 153.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 07:20:56,541 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.29ms. Allocated memory is still 117.4MB. Free memory is still 81.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.29ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 75.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.48ms. Allocated memory is still 117.4MB. Free memory was 75.4MB in the beginning and 70.8MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.27ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.0MB in the end (delta: 5.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 776.10ms. Allocated memory is still 117.4MB. Free memory was 65.0MB in the beginning and 76.4MB in the end (delta: -11.5MB). Peak memory consumption was 30.5MB. Max. memory is 16.1GB. * TraceAbstraction took 55834.06ms. Allocated memory was 117.4MB in the beginning and 587.2MB in the end (delta: 469.8MB). Free memory was 76.0MB in the beginning and 407.0MB in the end (delta: -331.0MB). Peak memory consumption was 136.4MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 587.2MB. Free memory was 407.0MB in the beginning and 406.8MB in the end (delta: 153.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 205, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someUnaryFLOAToperation at line 93. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_24 = 2; [L43] unsigned char var_1_27 = 0; [L44] unsigned char var_1_29 = 0; [L45] unsigned char var_1_30 = 0; [L46] unsigned char var_1_31 = 0; [L47] unsigned char var_1_32 = 1; [L48] unsigned char var_1_33 = 0; [L49] unsigned char var_1_34 = 16; [L50] signed short int var_1_35 = 8; [L51] signed long int var_1_36 = -10; [L52] signed short int var_1_37 = -4; [L53] float var_1_38 = 15.875; [L54] double var_1_39 = 0.125; [L55] double var_1_40 = 3.8; [L56] float var_1_42 = 1.75; [L57] signed char var_1_43 = -8; [L58] signed char var_1_45 = 25; [L59] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L209] isInitial = 1 [L210] FCALL initially() [L211] COND TRUE 1 [L212] CALL updateLastVariables() [L202] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-16, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L212] RET updateLastVariables() [L213] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L141] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L142] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L143] var_1_4 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L144] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L145] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L146] var_1_5 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L147] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L148] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L148] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L149] var_1_7 = __VERIFIER_nondet_long() [L150] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L150] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L151] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L151] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L152] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-4, var_1_9=50] [L153] var_1_8 = __VERIFIER_nondet_long() [L154] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L154] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L155] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L155] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L156] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L156] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L157] var_1_10 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L158] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L159] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L159] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L160] var_1_11 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L161] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L162] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L162] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L163] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L163] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L164] var_1_16 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L165] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L166] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L167] var_1_17 = __VERIFIER_nondet_ushort() [L168] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L168] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L169] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L169] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L170] var_1_21 = __VERIFIER_nondet_double() [L171] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L171] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L172] var_1_29 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L173] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L174] CALL assume_abort_if_not(var_1_29 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L174] RET assume_abort_if_not(var_1_29 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L175] var_1_30 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L176] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L177] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L177] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L178] var_1_31 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L179] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L180] CALL assume_abort_if_not(var_1_31 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L180] RET assume_abort_if_not(var_1_31 <= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L181] var_1_32 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L182] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L183] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L183] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=16, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L184] var_1_34 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L185] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L186] CALL assume_abort_if_not(var_1_34 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L186] RET assume_abort_if_not(var_1_34 <= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=-10, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L187] var_1_36 = __VERIFIER_nondet_long() [L188] CALL assume_abort_if_not(var_1_36 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L188] RET assume_abort_if_not(var_1_36 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L189] CALL assume_abort_if_not(var_1_36 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L189] RET assume_abort_if_not(var_1_36 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L190] CALL assume_abort_if_not(var_1_36 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L190] RET assume_abort_if_not(var_1_36 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_39=1/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L191] var_1_39 = __VERIFIER_nondet_double() [L192] CALL assume_abort_if_not((var_1_39 >= 0.0F && 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_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L192] RET assume_abort_if_not((var_1_39 >= 0.0F && 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_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_40=19/5, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L193] var_1_40 = __VERIFIER_nondet_double() [L194] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L194] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_42=7/4, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L195] var_1_42 = __VERIFIER_nondet_float() [L196] CALL assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L196] RET assume_abort_if_not((var_1_42 >= -922337.2036854765600e+13F && var_1_42 <= -1.0e-20F) || (var_1_42 <= 9223372.036854765600e+12F && var_1_42 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=25, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L197] var_1_45 = __VERIFIER_nondet_char() [L198] CALL assume_abort_if_not(var_1_45 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L198] RET assume_abort_if_not(var_1_45 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L199] CALL assume_abort_if_not(var_1_45 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L199] RET assume_abort_if_not(var_1_45 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L213] RET updateVariables() [L214] CALL step() [L63] var_1_22 = var_1_13 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L64] COND FALSE !(var_1_19 && var_1_19) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L69] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L80] COND TRUE var_1_6 != ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1))) [L81] var_1_33 = (5 + var_1_34) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=8, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L83] COND TRUE (~ var_1_34) > (var_1_1 / var_1_36) [L84] var_1_35 = (((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) < 0 ) ? -((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) : ((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=-4, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L86] var_1_37 = ((((((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) < (var_1_15)) ? (((((var_1_34) < 0 ) ? -(var_1_34) : (var_1_34)))) : (var_1_15))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L87] COND FALSE !(var_1_1 == var_1_36) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=127/8, var_1_3=-10, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L92] COND TRUE var_1_40 >= var_1_39 [L93] var_1_38 = ((((var_1_42) < 0 ) ? -(var_1_42) : (var_1_42))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L96] COND TRUE ! var_1_19 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L97] COND FALSE !(((var_1_34 + -128) % var_1_36) >= var_1_13) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=50] [L103] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L108] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L110] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L110] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L111] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L112] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L116] signed long int stepLocal_1 = -4; [L117] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L118] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L123] var_1_18 = var_1_17 [L124] var_1_19 = 0 [L125] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L126] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=10, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L129] COND TRUE var_1_3 <= var_1_1 [L130] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L134] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=65534, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=16, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L135] COND TRUE (~ var_1_3) < stepLocal_2 [L136] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L214] RET step() [L215] CALL, EXPR property() [L205] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L205-L206] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L215] RET, EXPR property() [L215] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=119, var_1_12=0, var_1_13=-5, var_1_15=183, var_1_16=119, var_1_17=65534, var_1_18=65534, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=16, var_1_24=2, var_1_27=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=5, var_1_34=0, var_1_35=50, var_1_36=1, var_1_37=0, var_1_38=2, var_1_3=-10, var_1_42=0, var_1_43=-8, var_1_45=-127, var_1_4=0, var_1_5=3, var_1_6=50, var_1_7=2, var_1_8=-1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.6s, OverallIterations: 15, TraceHistogramMax: 40, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2392 SdHoareTripleChecker+Valid, 9.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2362 mSDsluCounter, 9056 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6711 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4580 IncrementalHoareTripleChecker+Invalid, 5041 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 2345 mSDtfsCounter, 4580 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1637 GetRequests, 1514 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=519occurred in iteration=14, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 847 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 35.7s InterpolantComputationTime, 4351 NumberOfCodeBlocks, 4351 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 3820 ConstructedInterpolants, 0 QuantifiedInterpolants, 22309 SizeOfPredicates, 3 NumberOfNonLiveVariables, 575 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 46728/46800 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:20:56,759 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-07 07:20:56,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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-co_file-84.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 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 07:20:58,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 07:20:59,002 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:20:59,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 07:20:59,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 07:20:59,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 07:20:59,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 07:20:59,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 07:20:59,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 07:20:59,041 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 07:20:59,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 07:20:59,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 07:20:59,042 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 07:20:59,042 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 07:20:59,042 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 07:20:59,043 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 07:20:59,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 07:20:59,044 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 07:20:59,044 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 07:20:59,044 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 07:20:59,044 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 07:20:59,044 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 07:20:59,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:20:59,045 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 07:20:59,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 07:20:59,046 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 -> 923c55cd47017cc93a25a3016e3f55fbf64dcf09203b0c245c78e75ea53bbbc0 [2024-11-07 07:20:59,329 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 07:20:59,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 07:20:59,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 07:20:59,343 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 07:20:59,343 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 07:20:59,344 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-co_file-84.i [2024-11-07 07:21:00,750 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 07:21:00,980 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 07:21:00,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-07 07:21:00,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f49b41689/03ac0d677db146f2a9f385812b3b6c64/FLAG034fa3d3b [2024-11-07 07:21:01,315 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f49b41689/03ac0d677db146f2a9f385812b3b6c64 [2024-11-07 07:21:01,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 07:21:01,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 07:21:01,321 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 07:21:01,321 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 07:21:01,325 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 07:21:01,326 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,327 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4de62ec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01, skipping insertion in model container [2024-11-07 07:21:01,327 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 07:21:01,471 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-co_file-84.i[919,932] [2024-11-07 07:21:01,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:21:01,563 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 07:21:01,571 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-co_file-84.i[919,932] [2024-11-07 07:21:01,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 07:21:01,619 INFO L204 MainTranslator]: Completed translation [2024-11-07 07:21:01,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01 WrapperNode [2024-11-07 07:21:01,620 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 07:21:01,621 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 07:21:01,621 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 07:21:01,621 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 07:21:01,627 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:21:01" (1/1) ... [2024-11-07 07:21:01,644 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:21:01" (1/1) ... [2024-11-07 07:21:01,687 INFO L138 Inliner]: procedures = 27, calls = 53, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 221 [2024-11-07 07:21:01,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 07:21:01,692 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 07:21:01,692 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 07:21:01,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 07:21:01,704 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,736 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:21:01,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,754 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,767 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 07:21:01,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 07:21:01,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 07:21:01,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 07:21:01,781 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (1/1) ... [2024-11-07 07:21:01,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 07:21:01,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 07:21:01,817 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:21:01,820 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:21:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 07:21:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 07:21:01,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 07:21:01,847 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 07:21:01,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 07:21:01,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 07:21:01,949 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 07:21:01,951 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 07:21:02,965 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-07 07:21:02,966 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 07:21:02,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 07:21:02,979 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 07:21:02,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:02 BoogieIcfgContainer [2024-11-07 07:21:02,980 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 07:21:02,982 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 07:21:02,982 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 07:21:02,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 07:21:02,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 07:21:01" (1/3) ... [2024-11-07 07:21:02,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e04968e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:21:02, skipping insertion in model container [2024-11-07 07:21:02,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 07:21:01" (2/3) ... [2024-11-07 07:21:02,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e04968e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 07:21:02, skipping insertion in model container [2024-11-07 07:21:02,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 07:21:02" (3/3) ... [2024-11-07 07:21:02,991 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-84.i [2024-11-07 07:21:03,005 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 07:21:03,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 07:21:03,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 07:21:03,071 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;@5233b94e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 07:21:03,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 07:21:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:21:03,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 07:21:03,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:03,089 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:03,090 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:03,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:03,094 INFO L85 PathProgramCache]: Analyzing trace with hash 202276579, now seen corresponding path program 1 times [2024-11-07 07:21:03,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:21:03,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1028615789] [2024-11-07 07:21:03,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:03,105 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:21:03,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:21:03,107 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:21:03,112 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:21:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:03,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 07:21:03,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:21:03,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 2146 trivial. 0 not checked. [2024-11-07 07:21:03,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:21:03,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:21:03,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1028615789] [2024-11-07 07:21:03,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1028615789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:03,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:03,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 07:21:03,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631855035] [2024-11-07 07:21:03,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:03,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 07:21:03,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:21:03,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 07:21:03,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 07:21:03,629 INFO L87 Difference]: Start difference. First operand has 104 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 62 states have internal predecessors, (86), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:21:03,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:03,659 INFO L93 Difference]: Finished difference Result 201 states and 366 transitions. [2024-11-07 07:21:03,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 07:21:03,660 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 247 [2024-11-07 07:21:03,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:03,666 INFO L225 Difference]: With dead ends: 201 [2024-11-07 07:21:03,666 INFO L226 Difference]: Without dead ends: 100 [2024-11-07 07:21:03,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 246 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:21:03,671 INFO L432 NwaCegarLoop]: 159 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, 159 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:21:03,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 07:21:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-07 07:21:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-07 07:21:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.3620689655172413) internal successors, (79), 58 states have internal predecessors, (79), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:21:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 159 transitions. [2024-11-07 07:21:03,727 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 159 transitions. Word has length 247 [2024-11-07 07:21:03,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:03,728 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 159 transitions. [2024-11-07 07:21:03,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-07 07:21:03,728 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 159 transitions. [2024-11-07 07:21:03,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2024-11-07 07:21:03,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:03,734 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:03,749 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:21:03,936 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:21:03,936 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1439936235, now seen corresponding path program 1 times [2024-11-07 07:21:03,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:21:03,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691865193] [2024-11-07 07:21:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:03,939 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:21:03,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:21:03,942 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:21:03,944 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:21:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:04,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 07:21:04,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:21:04,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3120 trivial. 0 not checked. [2024-11-07 07:21:04,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 07:21:04,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 07:21:04,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691865193] [2024-11-07 07:21:04,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691865193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 07:21:04,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 07:21:04,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 07:21:04,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105849951] [2024-11-07 07:21:04,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 07:21:04,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 07:21:04,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 07:21:04,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 07:21:04,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 07:21:04,399 INFO L87 Difference]: Start difference. First operand 100 states and 159 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:21:04,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 07:21:04,502 INFO L93 Difference]: Finished difference Result 194 states and 309 transitions. [2024-11-07 07:21:04,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 07:21:04,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) Word has length 247 [2024-11-07 07:21:04,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 07:21:04,515 INFO L225 Difference]: With dead ends: 194 [2024-11-07 07:21:04,515 INFO L226 Difference]: Without dead ends: 97 [2024-11-07 07:21:04,516 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 245 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:21:04,517 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 07:21:04,517 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 144 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 07:21:04,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-07 07:21:04,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-07 07:21:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 55 states have internal predecessors, (69), 40 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 07:21:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2024-11-07 07:21:04,547 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 247 [2024-11-07 07:21:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 07:21:04,549 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2024-11-07 07:21:04,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (40), 1 states have call predecessors, (40), 1 states have return successors, (40), 1 states have call predecessors, (40), 1 states have call successors, (40) [2024-11-07 07:21:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2024-11-07 07:21:04,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-07 07:21:04,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 07:21:04,557 INFO L215 NwaCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:04,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 07:21:04,757 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:21:04,758 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 07:21:04,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 07:21:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash 785161106, now seen corresponding path program 1 times [2024-11-07 07:21:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 07:21:04,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415262959] [2024-11-07 07:21:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 07:21:04,759 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:21:04,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 07:21:04,763 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:21:04,763 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:21:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 07:21:05,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-07 07:21:05,453 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 07:21:08,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1147 proven. 36 refuted. 0 times theorem prover too weak. 1937 trivial. 0 not checked. [2024-11-07 07:21:08,377 INFO L311 TraceCheckSpWp]: Computing backward predicates...