./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.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', '6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.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 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:48:46,258 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:48:46,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:48:46,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:48:46,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:48:46,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:48:46,362 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:48:46,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:48:46,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:48:46,363 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:48:46,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:48:46,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:48:46,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:48:46,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:48:46,365 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:48:46,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:48:46,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:48:46,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:48:46,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:48:46,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:48:46,365 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:48:46,365 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:48:46,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:48:46,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:48:46,366 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:48:46,366 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:48:46,366 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:48:46,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:48:46,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:48:46,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:48:46,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:48:46,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:48:46,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:46,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:48:46,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:48:46,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:48:46,367 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:48:46,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:48:46,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:48:46,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:48:46,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:48:46,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:48:46,368 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 -> 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e [2024-11-07 05:48:46,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:48:46,607 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:48:46,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:48:46,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:48:46,610 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:48:46,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2024-11-07 05:48:47,734 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:48:47,970 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:48:47,971 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2024-11-07 05:48:47,977 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0032312/391b84fa1e214ebd92900b181f9cf341/FLAG5ede5dcf3 [2024-11-07 05:48:48,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/af0032312/391b84fa1e214ebd92900b181f9cf341 [2024-11-07 05:48:48,306 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:48:48,307 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:48:48,308 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:48,308 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:48:48,310 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:48:48,311 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,312 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1842822a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48, skipping insertion in model container [2024-11-07 05:48:48,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,330 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:48:48,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2024-11-07 05:48:48,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:48,478 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:48:48,486 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2024-11-07 05:48:48,508 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:48:48,524 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:48:48,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48 WrapperNode [2024-11-07 05:48:48,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:48:48,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:48,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:48:48,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:48:48,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,566 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 246 [2024-11-07 05:48:48,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:48:48,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:48:48,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:48:48,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:48:48,573 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,573 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,593 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:48:48,593 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,594 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,605 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,620 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:48:48,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:48:48,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:48:48,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:48:48,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (1/1) ... [2024-11-07 05:48:48,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:48:48,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:48:48,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:48:48,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:48:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:48:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:48:48,675 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:48:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:48:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:48:48,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:48:48,741 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:48:48,742 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:48:49,112 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-07 05:48:49,112 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:48:49,121 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:48:49,121 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:48:49,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:49 BoogieIcfgContainer [2024-11-07 05:48:49,122 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:48:49,123 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:48:49,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:48:49,127 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:48:49,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:48:48" (1/3) ... [2024-11-07 05:48:49,128 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365b0141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:49, skipping insertion in model container [2024-11-07 05:48:49,128 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:48:48" (2/3) ... [2024-11-07 05:48:49,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365b0141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:48:49, skipping insertion in model container [2024-11-07 05:48:49,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:49" (3/3) ... [2024-11-07 05:48:49,130 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2024-11-07 05:48:49,141 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:48:49,141 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:48:49,186 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:48:49,194 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;@5ca35e52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:48:49,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:48:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:49,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 05:48:49,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:49,212 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:49,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:49,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:49,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1779676502, now seen corresponding path program 1 times [2024-11-07 05:48:49,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:49,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724936847] [2024-11-07 05:48:49,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:49,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:49,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:49,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:49,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,535 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:49,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:49,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724936847] [2024-11-07 05:48:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724936847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:49,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:49,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:48:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119413865] [2024-11-07 05:48:49,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:49,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:48:49,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:49,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:48:49,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:48:49,560 INFO L87 Difference]: Start difference. First operand has 99 states, 74 states have (on average 1.472972972972973) internal successors, (109), 75 states have internal predecessors, (109), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:48:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:49,578 INFO L93 Difference]: Finished difference Result 188 states and 317 transitions. [2024-11-07 05:48:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:48:49,580 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 159 [2024-11-07 05:48:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:49,584 INFO L225 Difference]: With dead ends: 188 [2024-11-07 05:48:49,584 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 05:48:49,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:48:49,590 INFO L432 NwaCegarLoop]: 139 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, 139 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:49,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 05:48:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 05:48:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 139 transitions. [2024-11-07 05:48:49,628 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 139 transitions. Word has length 159 [2024-11-07 05:48:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:49,628 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 139 transitions. [2024-11-07 05:48:49,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:48:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 139 transitions. [2024-11-07 05:48:49,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 05:48:49,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:49,655 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:49,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:48:49,655 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:49,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:49,657 INFO L85 PathProgramCache]: Analyzing trace with hash -797181898, now seen corresponding path program 1 times [2024-11-07 05:48:49,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:49,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883369482] [2024-11-07 05:48:49,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:49,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:49,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:49,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:49,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:49,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:49,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:49,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883369482] [2024-11-07 05:48:49,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883369482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:49,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:49,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:49,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227331887] [2024-11-07 05:48:49,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:49,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:49,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:49,914 INFO L87 Difference]: Start difference. First operand 92 states and 139 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:49,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:49,970 INFO L93 Difference]: Finished difference Result 226 states and 343 transitions. [2024-11-07 05:48:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:49,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-07 05:48:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:49,978 INFO L225 Difference]: With dead ends: 226 [2024-11-07 05:48:49,980 INFO L226 Difference]: Without dead ends: 137 [2024-11-07 05:48:49,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:49,982 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 66 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:49,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 258 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:49,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-07 05:48:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2024-11-07 05:48:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 81 states have internal predecessors, (114), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:49,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 158 transitions. [2024-11-07 05:48:50,000 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 158 transitions. Word has length 159 [2024-11-07 05:48:50,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:50,002 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 158 transitions. [2024-11-07 05:48:50,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:50,002 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 158 transitions. [2024-11-07 05:48:50,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 05:48:50,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:50,007 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:50,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:48:50,008 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:50,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:50,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1126046136, now seen corresponding path program 1 times [2024-11-07 05:48:50,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:50,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580053634] [2024-11-07 05:48:50,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:50,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:50,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:50,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:50,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:50,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:50,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:50,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:50,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:50,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:50,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:50,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:50,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,414 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:50,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:50,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580053634] [2024-11-07 05:48:50,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580053634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:50,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:50,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:50,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282913691] [2024-11-07 05:48:50,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:50,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:50,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:50,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:50,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:50,417 INFO L87 Difference]: Start difference. First operand 105 states and 158 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:50,469 INFO L93 Difference]: Finished difference Result 211 states and 316 transitions. [2024-11-07 05:48:50,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:50,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-07 05:48:50,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:50,472 INFO L225 Difference]: With dead ends: 211 [2024-11-07 05:48:50,472 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 05:48:50,473 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:50,473 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:50,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 176 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 05:48:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 05:48:50,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.380952380952381) internal successors, (116), 84 states have internal predecessors, (116), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 160 transitions. [2024-11-07 05:48:50,486 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 160 transitions. Word has length 159 [2024-11-07 05:48:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:50,487 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 160 transitions. [2024-11-07 05:48:50,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:50,487 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 160 transitions. [2024-11-07 05:48:50,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-07 05:48:50,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:50,488 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:50,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 05:48:50,488 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:50,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:50,489 INFO L85 PathProgramCache]: Analyzing trace with hash -153817542, now seen corresponding path program 1 times [2024-11-07 05:48:50,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:50,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193157041] [2024-11-07 05:48:50,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:50,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:50,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:50,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:50,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:50,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:50,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:50,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:50,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:50,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:50,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:50,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193157041] [2024-11-07 05:48:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193157041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:50,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:50,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:48:50,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268183780] [2024-11-07 05:48:50,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:50,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:48:50,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:50,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:48:50,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:48:50,846 INFO L87 Difference]: Start difference. First operand 109 states and 160 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:51,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:51,162 INFO L93 Difference]: Finished difference Result 316 states and 469 transitions. [2024-11-07 05:48:51,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:48:51,162 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 159 [2024-11-07 05:48:51,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:51,164 INFO L225 Difference]: With dead ends: 316 [2024-11-07 05:48:51,164 INFO L226 Difference]: Without dead ends: 210 [2024-11-07 05:48:51,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:48:51,165 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 257 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:51,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 348 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:48:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-07 05:48:51,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 146. [2024-11-07 05:48:51,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 121 states have (on average 1.421487603305785) internal successors, (172), 121 states have internal predecessors, (172), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:51,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 216 transitions. [2024-11-07 05:48:51,178 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 216 transitions. Word has length 159 [2024-11-07 05:48:51,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:51,178 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 216 transitions. [2024-11-07 05:48:51,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 216 transitions. [2024-11-07 05:48:51,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:48:51,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:51,180 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:51,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 05:48:51,180 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:51,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:51,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1586459869, now seen corresponding path program 1 times [2024-11-07 05:48:51,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:51,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997227557] [2024-11-07 05:48:51,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:51,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:51,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,314 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:51,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:51,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997227557] [2024-11-07 05:48:51,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997227557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:51,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:51,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:51,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203299716] [2024-11-07 05:48:51,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:51,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:51,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:51,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:51,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:51,315 INFO L87 Difference]: Start difference. First operand 146 states and 216 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:51,363 INFO L93 Difference]: Finished difference Result 398 states and 589 transitions. [2024-11-07 05:48:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 05:48:51,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:51,365 INFO L225 Difference]: With dead ends: 398 [2024-11-07 05:48:51,365 INFO L226 Difference]: Without dead ends: 255 [2024-11-07 05:48:51,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:51,366 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 106 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:51,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 262 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:51,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-07 05:48:51,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 196. [2024-11-07 05:48:51,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 171 states have (on average 1.4502923976608186) internal successors, (248), 171 states have internal predecessors, (248), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2024-11-07 05:48:51,394 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 160 [2024-11-07 05:48:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:51,395 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 292 transitions. [2024-11-07 05:48:51,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 292 transitions. [2024-11-07 05:48:51,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:48:51,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:51,396 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:51,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 05:48:51,396 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:51,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash 113095613, now seen corresponding path program 1 times [2024-11-07 05:48:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096804959] [2024-11-07 05:48:51,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:51,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:51,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:51,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:51,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:51,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:51,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:51,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:51,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:51,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:51,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:51,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096804959] [2024-11-07 05:48:51,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096804959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:51,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:51,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 05:48:51,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501621465] [2024-11-07 05:48:51,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:51,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:48:51,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:51,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:48:51,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:48:51,762 INFO L87 Difference]: Start difference. First operand 196 states and 292 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:52,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:52,287 INFO L93 Difference]: Finished difference Result 615 states and 904 transitions. [2024-11-07 05:48:52,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:48:52,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 05:48:52,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:52,290 INFO L225 Difference]: With dead ends: 615 [2024-11-07 05:48:52,290 INFO L226 Difference]: Without dead ends: 422 [2024-11-07 05:48:52,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:48:52,291 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 508 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:52,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 643 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:48:52,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2024-11-07 05:48:52,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 200. [2024-11-07 05:48:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 175 states have (on average 1.44) internal successors, (252), 175 states have internal predecessors, (252), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:52,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 296 transitions. [2024-11-07 05:48:52,316 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 296 transitions. Word has length 160 [2024-11-07 05:48:52,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:52,317 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 296 transitions. [2024-11-07 05:48:52,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:52,317 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 296 transitions. [2024-11-07 05:48:52,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:48:52,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:52,331 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:52,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 05:48:52,332 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:52,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash 253644223, now seen corresponding path program 1 times [2024-11-07 05:48:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:52,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699937127] [2024-11-07 05:48:52,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:52,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:52,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:52,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:52,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:52,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:52,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:53,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:53,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:53,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,028 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:53,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:53,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699937127] [2024-11-07 05:48:53,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699937127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:53,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:53,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:48:53,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282993069] [2024-11-07 05:48:53,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:53,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:48:53,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:53,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:48:53,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:48:53,029 INFO L87 Difference]: Start difference. First operand 200 states and 296 transitions. Second operand has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:53,394 INFO L93 Difference]: Finished difference Result 621 states and 909 transitions. [2024-11-07 05:48:53,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:48:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 05:48:53,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:53,397 INFO L225 Difference]: With dead ends: 621 [2024-11-07 05:48:53,398 INFO L226 Difference]: Without dead ends: 424 [2024-11-07 05:48:53,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:48:53,399 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 334 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:53,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 810 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:48:53,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-07 05:48:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 221. [2024-11-07 05:48:53,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 196 states have (on average 1.4438775510204083) internal successors, (283), 196 states have internal predecessors, (283), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 327 transitions. [2024-11-07 05:48:53,427 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 327 transitions. Word has length 160 [2024-11-07 05:48:53,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:53,428 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 327 transitions. [2024-11-07 05:48:53,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.3) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 327 transitions. [2024-11-07 05:48:53,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:48:53,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:53,429 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:53,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 05:48:53,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:53,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:53,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1171311360, now seen corresponding path program 1 times [2024-11-07 05:48:53,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:53,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519426518] [2024-11-07 05:48:53,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:53,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:53,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:53,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:53,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:53,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:53,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:53,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519426518] [2024-11-07 05:48:53,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519426518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:53,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:53,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 05:48:53,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421605895] [2024-11-07 05:48:53,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:53,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 05:48:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:53,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 05:48:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:48:53,953 INFO L87 Difference]: Start difference. First operand 221 states and 327 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:54,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:54,507 INFO L93 Difference]: Finished difference Result 572 states and 842 transitions. [2024-11-07 05:48:54,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:48:54,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 05:48:54,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:54,511 INFO L225 Difference]: With dead ends: 572 [2024-11-07 05:48:54,511 INFO L226 Difference]: Without dead ends: 354 [2024-11-07 05:48:54,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:48:54,512 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 231 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:54,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 858 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 05:48:54,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-07 05:48:54,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 243. [2024-11-07 05:48:54,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 218 states have (on average 1.4541284403669725) internal successors, (317), 218 states have internal predecessors, (317), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 361 transitions. [2024-11-07 05:48:54,548 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 361 transitions. Word has length 160 [2024-11-07 05:48:54,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:54,549 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 361 transitions. [2024-11-07 05:48:54,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:54,550 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 361 transitions. [2024-11-07 05:48:54,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-07 05:48:54,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:54,552 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:54,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 05:48:54,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:54,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:54,552 INFO L85 PathProgramCache]: Analyzing trace with hash -200384255, now seen corresponding path program 1 times [2024-11-07 05:48:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:54,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288201381] [2024-11-07 05:48:54,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:54,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:54,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:54,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:54,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:54,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:54,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:54,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:54,640 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:54,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:54,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288201381] [2024-11-07 05:48:54,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288201381] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:54,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:54,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:54,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49974705] [2024-11-07 05:48:54,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:54,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:54,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:54,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:54,642 INFO L87 Difference]: Start difference. First operand 243 states and 361 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:54,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:54,682 INFO L93 Difference]: Finished difference Result 567 states and 844 transitions. [2024-11-07 05:48:54,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:54,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 160 [2024-11-07 05:48:54,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:54,684 INFO L225 Difference]: With dead ends: 567 [2024-11-07 05:48:54,684 INFO L226 Difference]: Without dead ends: 327 [2024-11-07 05:48:54,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:54,685 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 56 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:54,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 317 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:54,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-07 05:48:54,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 241. [2024-11-07 05:48:54,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 216 states have (on average 1.412037037037037) internal successors, (305), 216 states have internal predecessors, (305), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:48:54,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 349 transitions. [2024-11-07 05:48:54,710 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 349 transitions. Word has length 160 [2024-11-07 05:48:54,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:54,710 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 349 transitions. [2024-11-07 05:48:54,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:54,711 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 349 transitions. [2024-11-07 05:48:54,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:48:54,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:54,713 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:54,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 05:48:54,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:54,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:54,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1033365593, now seen corresponding path program 1 times [2024-11-07 05:48:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:54,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115702936] [2024-11-07 05:48:54,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:54,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:55,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:55,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:55,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:55,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:55,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:55,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,149 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:55,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:55,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115702936] [2024-11-07 05:48:55,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115702936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:55,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:55,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 05:48:55,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351444581] [2024-11-07 05:48:55,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:55,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:48:55,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:55,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:48:55,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:48:55,152 INFO L87 Difference]: Start difference. First operand 241 states and 349 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:55,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:55,391 INFO L93 Difference]: Finished difference Result 897 states and 1293 transitions. [2024-11-07 05:48:55,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:48:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-07 05:48:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:55,394 INFO L225 Difference]: With dead ends: 897 [2024-11-07 05:48:55,395 INFO L226 Difference]: Without dead ends: 659 [2024-11-07 05:48:55,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:48:55,396 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 190 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:55,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 557 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:48:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2024-11-07 05:48:55,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 432. [2024-11-07 05:48:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 404 states have (on average 1.4158415841584158) internal successors, (572), 405 states have internal predecessors, (572), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 05:48:55,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 620 transitions. [2024-11-07 05:48:55,431 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 620 transitions. Word has length 161 [2024-11-07 05:48:55,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 620 transitions. [2024-11-07 05:48:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 620 transitions. [2024-11-07 05:48:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:48:55,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:55,435 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:55,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 05:48:55,436 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:55,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:55,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1095405207, now seen corresponding path program 1 times [2024-11-07 05:48:55,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:55,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945415936] [2024-11-07 05:48:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:55,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:55,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:55,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:55,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:55,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:55,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:55,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:55,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:55,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:55,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:55,785 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:55,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:55,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945415936] [2024-11-07 05:48:55,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945415936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:55,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 05:48:55,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292646127] [2024-11-07 05:48:55,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:55,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 05:48:55,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:55,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 05:48:55,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:48:55,787 INFO L87 Difference]: Start difference. First operand 432 states and 620 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:56,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:56,104 INFO L93 Difference]: Finished difference Result 987 states and 1409 transitions. [2024-11-07 05:48:56,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:48:56,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-07 05:48:56,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:56,111 INFO L225 Difference]: With dead ends: 987 [2024-11-07 05:48:56,111 INFO L226 Difference]: Without dead ends: 558 [2024-11-07 05:48:56,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:48:56,113 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 95 mSDsluCounter, 940 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:56,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1136 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:48:56,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-07 05:48:56,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 481. [2024-11-07 05:48:56,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 453 states have (on average 1.4128035320088301) internal successors, (640), 454 states have internal predecessors, (640), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 05:48:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 688 transitions. [2024-11-07 05:48:56,167 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 688 transitions. Word has length 161 [2024-11-07 05:48:56,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:56,168 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 688 transitions. [2024-11-07 05:48:56,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:56,168 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 688 transitions. [2024-11-07 05:48:56,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:48:56,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:56,172 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:56,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 05:48:56,172 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:56,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:56,172 INFO L85 PathProgramCache]: Analyzing trace with hash -2052949699, now seen corresponding path program 1 times [2024-11-07 05:48:56,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:56,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109956046] [2024-11-07 05:48:56,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:56,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:56,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:56,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:56,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:56,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:56,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:56,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:56,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:56,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:56,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:56,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:56,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109956046] [2024-11-07 05:48:56,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109956046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:56,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:56,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:56,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675439955] [2024-11-07 05:48:56,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:56,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:56,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:56,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:56,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:56,290 INFO L87 Difference]: Start difference. First operand 481 states and 688 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:56,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:56,359 INFO L93 Difference]: Finished difference Result 1040 states and 1481 transitions. [2024-11-07 05:48:56,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:56,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-07 05:48:56,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:56,362 INFO L225 Difference]: With dead ends: 1040 [2024-11-07 05:48:56,362 INFO L226 Difference]: Without dead ends: 562 [2024-11-07 05:48:56,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:56,363 INFO L432 NwaCegarLoop]: 231 mSDtfsCounter, 98 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:56,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 351 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:56,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2024-11-07 05:48:56,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 407. [2024-11-07 05:48:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 379 states have (on average 1.3825857519788918) internal successors, (524), 380 states have internal predecessors, (524), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 05:48:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 572 transitions. [2024-11-07 05:48:56,394 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 572 transitions. Word has length 161 [2024-11-07 05:48:56,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:56,394 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 572 transitions. [2024-11-07 05:48:56,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 572 transitions. [2024-11-07 05:48:56,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:48:56,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:56,396 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:56,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 05:48:56,396 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:56,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:56,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1364441673, now seen corresponding path program 1 times [2024-11-07 05:48:56,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:56,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490401339] [2024-11-07 05:48:56,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:56,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:56,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:56,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:56,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:56,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:56,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:56,816 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:56,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:56,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490401339] [2024-11-07 05:48:56,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490401339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:56,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:56,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:48:56,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822532942] [2024-11-07 05:48:56,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:56,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:48:56,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:56,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:48:56,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:48:56,817 INFO L87 Difference]: Start difference. First operand 407 states and 572 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:57,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:57,121 INFO L93 Difference]: Finished difference Result 1099 states and 1544 transitions. [2024-11-07 05:48:57,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:48:57,122 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-07 05:48:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:57,124 INFO L225 Difference]: With dead ends: 1099 [2024-11-07 05:48:57,124 INFO L226 Difference]: Without dead ends: 695 [2024-11-07 05:48:57,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:48:57,126 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 149 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:57,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1005 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:48:57,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2024-11-07 05:48:57,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 401. [2024-11-07 05:48:57,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 373 states have (on average 1.388739946380697) internal successors, (518), 374 states have internal predecessors, (518), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 05:48:57,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 566 transitions. [2024-11-07 05:48:57,155 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 566 transitions. Word has length 161 [2024-11-07 05:48:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:57,156 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 566 transitions. [2024-11-07 05:48:57,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 566 transitions. [2024-11-07 05:48:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-07 05:48:57,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:57,158 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:57,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 05:48:57,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:57,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:57,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1619530556, now seen corresponding path program 1 times [2024-11-07 05:48:57,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:57,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018540773] [2024-11-07 05:48:57,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:57,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:57,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:57,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:57,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:57,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:57,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:57,546 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018540773] [2024-11-07 05:48:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018540773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:48:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595567019] [2024-11-07 05:48:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:48:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:57,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:48:57,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:48:57,548 INFO L87 Difference]: Start difference. First operand 401 states and 566 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:57,863 INFO L93 Difference]: Finished difference Result 1056 states and 1487 transitions. [2024-11-07 05:48:57,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:48:57,864 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 161 [2024-11-07 05:48:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:57,866 INFO L225 Difference]: With dead ends: 1056 [2024-11-07 05:48:57,867 INFO L226 Difference]: Without dead ends: 658 [2024-11-07 05:48:57,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:48:57,868 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 202 mSDsluCounter, 977 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:57,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1175 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:48:57,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-07 05:48:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 403. [2024-11-07 05:48:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 375 states have (on average 1.3866666666666667) internal successors, (520), 376 states have internal predecessors, (520), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 05:48:57,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 568 transitions. [2024-11-07 05:48:57,896 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 568 transitions. Word has length 161 [2024-11-07 05:48:57,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:57,897 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 568 transitions. [2024-11-07 05:48:57,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:57,897 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 568 transitions. [2024-11-07 05:48:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 05:48:57,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:57,899 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:57,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 05:48:57,899 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:57,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:57,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1723464490, now seen corresponding path program 1 times [2024-11-07 05:48:57,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186237112] [2024-11-07 05:48:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:57,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:57,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:58,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:58,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:58,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:58,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:58,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,265 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186237112] [2024-11-07 05:48:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186237112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:58,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:58,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 05:48:58,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823834987] [2024-11-07 05:48:58,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:58,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 05:48:58,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:58,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 05:48:58,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:48:58,266 INFO L87 Difference]: Start difference. First operand 403 states and 568 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:58,514 INFO L93 Difference]: Finished difference Result 991 states and 1397 transitions. [2024-11-07 05:48:58,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:48:58,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-07 05:48:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:58,518 INFO L225 Difference]: With dead ends: 991 [2024-11-07 05:48:58,519 INFO L226 Difference]: Without dead ends: 591 [2024-11-07 05:48:58,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:48:58,520 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 118 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:58,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 813 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:48:58,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2024-11-07 05:48:58,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 397. [2024-11-07 05:48:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 369 states have (on average 1.3929539295392954) internal successors, (514), 370 states have internal predecessors, (514), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 05:48:58,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 562 transitions. [2024-11-07 05:48:58,549 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 562 transitions. Word has length 162 [2024-11-07 05:48:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:58,549 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 562 transitions. [2024-11-07 05:48:58,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 9 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:58,549 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 562 transitions. [2024-11-07 05:48:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 05:48:58,551 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:58,551 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:58,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 05:48:58,552 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:58,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:58,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1609489190, now seen corresponding path program 1 times [2024-11-07 05:48:58,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:58,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511825539] [2024-11-07 05:48:58,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:58,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:58,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:58,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:58,783 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:58,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:58,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511825539] [2024-11-07 05:48:58,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511825539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:58,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:58,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 05:48:58,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574577558] [2024-11-07 05:48:58,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:58,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:48:58,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:58,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:48:58,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:48:58,785 INFO L87 Difference]: Start difference. First operand 397 states and 562 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:59,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:59,046 INFO L93 Difference]: Finished difference Result 1009 states and 1426 transitions. [2024-11-07 05:48:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:48:59,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-07 05:48:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:59,051 INFO L225 Difference]: With dead ends: 1009 [2024-11-07 05:48:59,052 INFO L226 Difference]: Without dead ends: 615 [2024-11-07 05:48:59,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:48:59,054 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 366 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:59,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 319 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:48:59,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-07 05:48:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 402. [2024-11-07 05:48:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 368 states have (on average 1.3831521739130435) internal successors, (509), 370 states have internal predecessors, (509), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:48:59,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 565 transitions. [2024-11-07 05:48:59,094 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 565 transitions. Word has length 162 [2024-11-07 05:48:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:59,094 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 565 transitions. [2024-11-07 05:48:59,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 565 transitions. [2024-11-07 05:48:59,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 05:48:59,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:59,097 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:59,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 05:48:59,097 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:59,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash -897237029, now seen corresponding path program 1 times [2024-11-07 05:48:59,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:59,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227639151] [2024-11-07 05:48:59,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:59,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:59,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:59,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,190 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:59,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:59,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227639151] [2024-11-07 05:48:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227639151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:59,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:48:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304001845] [2024-11-07 05:48:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:59,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:48:59,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:59,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:48:59,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:59,192 INFO L87 Difference]: Start difference. First operand 402 states and 565 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:59,267 INFO L93 Difference]: Finished difference Result 965 states and 1358 transitions. [2024-11-07 05:48:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:48:59,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-07 05:48:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:59,270 INFO L225 Difference]: With dead ends: 965 [2024-11-07 05:48:59,270 INFO L226 Difference]: Without dead ends: 581 [2024-11-07 05:48:59,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:48:59,271 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 112 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:59,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 280 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:48:59,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-07 05:48:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 502. [2024-11-07 05:48:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 468 states have (on average 1.391025641025641) internal successors, (651), 470 states have internal predecessors, (651), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:48:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 707 transitions. [2024-11-07 05:48:59,309 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 707 transitions. Word has length 162 [2024-11-07 05:48:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:59,310 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 707 transitions. [2024-11-07 05:48:59,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 707 transitions. [2024-11-07 05:48:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 05:48:59,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:59,312 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:59,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 05:48:59,312 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:59,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash -611888444, now seen corresponding path program 1 times [2024-11-07 05:48:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:59,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060416601] [2024-11-07 05:48:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:48:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:48:59,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:48:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:48:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:48:59,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:48:59,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:48:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:48:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:48:59,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:48:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:48:59,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:48:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:48:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:48:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:48:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:48:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:48:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:48:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:48:59,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:48:59,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:48:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:48:59,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:48:59,446 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:48:59,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:48:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060416601] [2024-11-07 05:48:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060416601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:48:59,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:48:59,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 05:48:59,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668892490] [2024-11-07 05:48:59,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:48:59,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 05:48:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:48:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 05:48:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 05:48:59,448 INFO L87 Difference]: Start difference. First operand 502 states and 707 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:59,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:48:59,913 INFO L93 Difference]: Finished difference Result 1578 states and 2250 transitions. [2024-11-07 05:48:59,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 05:48:59,913 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-07 05:48:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:48:59,917 INFO L225 Difference]: With dead ends: 1578 [2024-11-07 05:48:59,918 INFO L226 Difference]: Without dead ends: 1094 [2024-11-07 05:48:59,918 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 05:48:59,919 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 475 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:48:59,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 415 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:48:59,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1094 states. [2024-11-07 05:48:59,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1094 to 565. [2024-11-07 05:48:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 531 states have (on average 1.3615819209039548) internal successors, (723), 533 states have internal predecessors, (723), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:48:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 779 transitions. [2024-11-07 05:48:59,964 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 779 transitions. Word has length 162 [2024-11-07 05:48:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:48:59,965 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 779 transitions. [2024-11-07 05:48:59,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:48:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 779 transitions. [2024-11-07 05:48:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-07 05:48:59,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:48:59,966 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:48:59,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 05:48:59,967 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:48:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:48:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1994135110, now seen corresponding path program 1 times [2024-11-07 05:48:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:48:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610517538] [2024-11-07 05:48:59,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:48:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:48:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:49:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:49:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:49:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:49:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:49:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:49:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:49:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:49:00,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:49:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:49:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:49:00,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:49:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:49:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:49:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:49:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:49:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:49:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:49:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:49:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:49:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:49:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:49:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:00,343 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:49:00,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610517538] [2024-11-07 05:49:00,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610517538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:00,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:00,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:49:00,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993460264] [2024-11-07 05:49:00,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:00,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:49:00,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:49:00,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:49:00,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:49:00,345 INFO L87 Difference]: Start difference. First operand 565 states and 779 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:00,691 INFO L93 Difference]: Finished difference Result 1337 states and 1844 transitions. [2024-11-07 05:49:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:49:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 162 [2024-11-07 05:49:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:00,695 INFO L225 Difference]: With dead ends: 1337 [2024-11-07 05:49:00,695 INFO L226 Difference]: Without dead ends: 790 [2024-11-07 05:49:00,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:49:00,696 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 190 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:00,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1229 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:49:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2024-11-07 05:49:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 522. [2024-11-07 05:49:00,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 488 states have (on average 1.3565573770491803) internal successors, (662), 490 states have internal predecessors, (662), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:49:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 718 transitions. [2024-11-07 05:49:00,736 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 718 transitions. Word has length 162 [2024-11-07 05:49:00,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:00,737 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 718 transitions. [2024-11-07 05:49:00,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:00,737 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 718 transitions. [2024-11-07 05:49:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:49:00,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:00,739 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:00,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 05:49:00,739 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:00,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:00,739 INFO L85 PathProgramCache]: Analyzing trace with hash -131035214, now seen corresponding path program 1 times [2024-11-07 05:49:00,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:49:00,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010042433] [2024-11-07 05:49:00,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:00,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:49:00,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:49:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:49:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:49:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:49:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:49:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:49:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:49:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:01,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:49:02,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:49:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:49:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:49:02,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:49:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:49:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:49:02,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:49:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:49:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:49:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:49:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:49:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:49:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:49:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:49:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:02,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:49:02,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010042433] [2024-11-07 05:49:02,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010042433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:02,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:02,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 05:49:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055581475] [2024-11-07 05:49:02,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:02,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 05:49:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:49:02,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 05:49:02,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:49:02,020 INFO L87 Difference]: Start difference. First operand 522 states and 718 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:02,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:02,827 INFO L93 Difference]: Finished difference Result 1215 states and 1671 transitions. [2024-11-07 05:49:02,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 05:49:02,828 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-07 05:49:02,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:02,830 INFO L225 Difference]: With dead ends: 1215 [2024-11-07 05:49:02,830 INFO L226 Difference]: Without dead ends: 711 [2024-11-07 05:49:02,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2024-11-07 05:49:02,834 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 394 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:02,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 834 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:49:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-07 05:49:02,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 568. [2024-11-07 05:49:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 568 states, 534 states have (on average 1.3614232209737829) internal successors, (727), 536 states have internal predecessors, (727), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:49:02,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 783 transitions. [2024-11-07 05:49:02,872 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 783 transitions. Word has length 163 [2024-11-07 05:49:02,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:02,872 INFO L471 AbstractCegarLoop]: Abstraction has 568 states and 783 transitions. [2024-11-07 05:49:02,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:02,872 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 783 transitions. [2024-11-07 05:49:02,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:49:02,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:02,874 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:02,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 05:49:02,875 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:02,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:02,875 INFO L85 PathProgramCache]: Analyzing trace with hash -186206657, now seen corresponding path program 1 times [2024-11-07 05:49:02,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:49:02,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100125524] [2024-11-07 05:49:02,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:02,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:49:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:49:02,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:49:02,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:49:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:49:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:49:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:49:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:49:02,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:49:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:49:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:49:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:49:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:49:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:49:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:49:02,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:49:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:49:02,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:49:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:49:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:49:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:49:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:49:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:49:02,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:02,944 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:02,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:49:02,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100125524] [2024-11-07 05:49:02,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100125524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:02,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:02,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:49:02,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529948309] [2024-11-07 05:49:02,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:02,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:49:02,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:49:02,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:49:02,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:02,947 INFO L87 Difference]: Start difference. First operand 568 states and 783 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:03,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:03,020 INFO L93 Difference]: Finished difference Result 1266 states and 1751 transitions. [2024-11-07 05:49:03,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:49:03,021 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-07 05:49:03,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:03,024 INFO L225 Difference]: With dead ends: 1266 [2024-11-07 05:49:03,025 INFO L226 Difference]: Without dead ends: 716 [2024-11-07 05:49:03,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:03,026 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 109 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:03,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 297 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:49:03,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-11-07 05:49:03,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 576. [2024-11-07 05:49:03,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 542 states have (on average 1.3597785977859778) internal successors, (737), 544 states have internal predecessors, (737), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:49:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 793 transitions. [2024-11-07 05:49:03,076 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 793 transitions. Word has length 163 [2024-11-07 05:49:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:03,077 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 793 transitions. [2024-11-07 05:49:03,077 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, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:03,077 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 793 transitions. [2024-11-07 05:49:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:49:03,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:03,079 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:03,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 05:49:03,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:03,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash -330551427, now seen corresponding path program 1 times [2024-11-07 05:49:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:49:03,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012492658] [2024-11-07 05:49:03,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:49:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:49:03,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:49:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:49:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:49:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:49:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:49:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:49:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:49:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:49:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:49:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:49:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:49:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:49:03,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:49:03,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:49:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:49:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:49:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:49:03,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:49:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:49:03,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:03,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:49:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:49:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:49:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012492658] [2024-11-07 05:49:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012492658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 05:49:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291306567] [2024-11-07 05:49:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 05:49:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:49:04,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 05:49:04,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-07 05:49:04,004 INFO L87 Difference]: Start difference. First operand 576 states and 793 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:04,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:04,445 INFO L93 Difference]: Finished difference Result 1269 states and 1746 transitions. [2024-11-07 05:49:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 05:49:04,445 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-07 05:49:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:04,450 INFO L225 Difference]: With dead ends: 1269 [2024-11-07 05:49:04,450 INFO L226 Difference]: Without dead ends: 711 [2024-11-07 05:49:04,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2024-11-07 05:49:04,453 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 407 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:04,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 373 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 05:49:04,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-07 05:49:04,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 585. [2024-11-07 05:49:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 551 states have (on average 1.355716878402904) internal successors, (747), 553 states have internal predecessors, (747), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:49:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 803 transitions. [2024-11-07 05:49:04,488 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 803 transitions. Word has length 163 [2024-11-07 05:49:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 803 transitions. [2024-11-07 05:49:04,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 803 transitions. [2024-11-07 05:49:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:49:04,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:04,492 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:04,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 05:49:04,492 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1807550829, now seen corresponding path program 1 times [2024-11-07 05:49:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:49:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723504656] [2024-11-07 05:49:04,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:49:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:49:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:49:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:49:04,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:49:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:49:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:49:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:49:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:49:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:49:04,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:49:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:49:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:49:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:49:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:49:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:49:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:49:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:49:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:49:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:49:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:49:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:49:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:49:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:04,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:49:04,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723504656] [2024-11-07 05:49:04,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723504656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:04,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:04,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-07 05:49:04,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338686664] [2024-11-07 05:49:04,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:04,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 05:49:04,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:49:04,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 05:49:04,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-07 05:49:04,866 INFO L87 Difference]: Start difference. First operand 585 states and 803 transitions. Second operand has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:05,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:05,569 INFO L93 Difference]: Finished difference Result 1484 states and 2039 transitions. [2024-11-07 05:49:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 05:49:05,570 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-07 05:49:05,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:05,574 INFO L225 Difference]: With dead ends: 1484 [2024-11-07 05:49:05,574 INFO L226 Difference]: Without dead ends: 917 [2024-11-07 05:49:05,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2024-11-07 05:49:05,576 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 376 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 903 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 903 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:05,576 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 1721 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 903 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 05:49:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-07 05:49:05,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 589. [2024-11-07 05:49:05,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 589 states, 555 states have (on average 1.3567567567567567) internal successors, (753), 557 states have internal predecessors, (753), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:49:05,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 809 transitions. [2024-11-07 05:49:05,614 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 809 transitions. Word has length 163 [2024-11-07 05:49:05,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:05,614 INFO L471 AbstractCegarLoop]: Abstraction has 589 states and 809 transitions. [2024-11-07 05:49:05,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.3076923076923075) internal successors, (56), 13 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:05,614 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 809 transitions. [2024-11-07 05:49:05,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:49:05,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:05,617 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:05,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 05:49:05,617 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:05,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:05,617 INFO L85 PathProgramCache]: Analyzing trace with hash -219202927, now seen corresponding path program 1 times [2024-11-07 05:49:05,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:49:05,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018662581] [2024-11-07 05:49:05,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:05,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:49:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:49:05,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:49:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:49:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:49:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:49:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:49:05,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:49:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 05:49:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 05:49:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-07 05:49:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-07 05:49:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-07 05:49:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-07 05:49:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-07 05:49:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-07 05:49:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-07 05:49:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-07 05:49:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-07 05:49:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-07 05:49:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-07 05:49:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-07 05:49:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 05:49:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:05,928 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:05,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:49:05,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018662581] [2024-11-07 05:49:05,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018662581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:05,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:05,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 05:49:05,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725274838] [2024-11-07 05:49:05,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:05,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 05:49:05,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:49:05,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 05:49:05,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-07 05:49:05,930 INFO L87 Difference]: Start difference. First operand 589 states and 809 transitions. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:06,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:06,136 INFO L93 Difference]: Finished difference Result 1418 states and 1952 transitions. [2024-11-07 05:49:06,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 05:49:06,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 163 [2024-11-07 05:49:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:06,141 INFO L225 Difference]: With dead ends: 1418 [2024-11-07 05:49:06,141 INFO L226 Difference]: Without dead ends: 847 [2024-11-07 05:49:06,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-07 05:49:06,143 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 117 mSDsluCounter, 920 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:06,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1137 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 05:49:06,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2024-11-07 05:49:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 477. [2024-11-07 05:49:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 443 states have (on average 1.3386004514672687) internal successors, (593), 445 states have internal predecessors, (593), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-07 05:49:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 649 transitions. [2024-11-07 05:49:06,179 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 649 transitions. Word has length 163 [2024-11-07 05:49:06,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:06,180 INFO L471 AbstractCegarLoop]: Abstraction has 477 states and 649 transitions. [2024-11-07 05:49:06,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:06,180 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 649 transitions. [2024-11-07 05:49:06,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-07 05:49:06,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:06,182 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:06,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 05:49:06,182 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:06,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:06,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1865545422, now seen corresponding path program 1 times [2024-11-07 05:49:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:49:06,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216097153] [2024-11-07 05:49:06,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:06,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:49:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:49:06,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 05:49:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 05:49:06,335 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 05:49:06,335 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 05:49:06,336 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 05:49:06,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 05:49:06,340 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:06,452 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 05:49:06,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:49:06 BoogieIcfgContainer [2024-11-07 05:49:06,454 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 05:49:06,455 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 05:49:06,455 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 05:49:06,455 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 05:49:06,456 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:48:49" (3/4) ... [2024-11-07 05:49:06,457 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 05:49:06,458 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 05:49:06,458 INFO L158 Benchmark]: Toolchain (without parser) took 18151.81ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 91.2MB in the beginning and 241.8MB in the end (delta: -150.6MB). Peak memory consumption was 272.8MB. Max. memory is 16.1GB. [2024-11-07 05:49:06,459 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:49:06,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.43ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 75.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 05:49:06,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.96ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 70.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 05:49:06,460 INFO L158 Benchmark]: Boogie Preprocessor took 53.72ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:49:06,460 INFO L158 Benchmark]: RCFGBuilder took 499.78ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 81.1MB in the end (delta: -16.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. [2024-11-07 05:49:06,460 INFO L158 Benchmark]: TraceAbstraction took 17331.57ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 80.6MB in the beginning and 241.9MB in the end (delta: -161.2MB). Peak memory consumption was 250.7MB. Max. memory is 16.1GB. [2024-11-07 05:49:06,460 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 536.9MB. Free memory was 241.9MB in the beginning and 241.8MB in the end (delta: 112.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 05:49:06,461 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.21ms. Allocated memory is still 117.4MB. Free memory is still 81.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.43ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 75.2MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.96ms. Allocated memory is still 117.4MB. Free memory was 75.2MB in the beginning and 70.8MB in the end (delta: 4.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 53.72ms. Allocated memory is still 117.4MB. Free memory was 70.8MB in the beginning and 65.0MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 499.78ms. Allocated memory is still 117.4MB. Free memory was 64.9MB in the beginning and 81.1MB in the end (delta: -16.3MB). Peak memory consumption was 30.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17331.57ms. Allocated memory was 117.4MB in the beginning and 536.9MB in the end (delta: 419.4MB). Free memory was 80.6MB in the beginning and 241.9MB in the end (delta: -161.2MB). Peak memory consumption was 250.7MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 536.9MB. Free memory was 241.9MB in the beginning and 241.8MB in the end (delta: 112.6kB). 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 182, overapproximation of someBinaryFLOATComparisonOperation at line 182, overapproximation of someBinaryArithmeticDOUBLEoperation at line 109. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] unsigned char var_1_33 = 8; [L44] double var_1_40 = 8.35; [L45] unsigned short int var_1_45 = 50; [L46] unsigned char var_1_46 = 0; [L47] unsigned char var_1_47 = 5; [L48] unsigned char var_1_48 = 1; [L49] signed char var_1_49 = -16; [L50] signed char var_1_50 = 2; [L51] signed char var_1_51 = 16; [L52] signed long int var_1_53 = 256; [L53] double var_1_54 = 1.25; [L54] unsigned long int var_1_55 = 5; [L55] signed long int last_1_var_1_1 = 64; [L56] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L186] isInitial = 1 [L187] FCALL initially() [L188] COND TRUE 1 [L189] CALL updateLastVariables() [L178] last_1_var_1_1 = var_1_1 [L179] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_7 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L141] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5] [L142] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L142] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L143] var_1_15 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L144] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L145] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L146] var_1_16 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L147] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L148] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L149] var_1_18 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L150] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L151] var_1_19 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L152] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L153] var_1_20 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L154] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L155] var_1_21 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L156] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L157] var_1_22 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L158] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L159] var_1_23 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L160] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L161] var_1_27 = __VERIFIER_nondet_char() [L162] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L162] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L163] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L164] var_1_28 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L165] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L166] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=5, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L167] var_1_47 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_47 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L168] RET assume_abort_if_not(var_1_47 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] CALL assume_abort_if_not(var_1_47 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L169] RET assume_abort_if_not(var_1_47 <= 127) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=2, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L170] var_1_50 = __VERIFIER_nondet_char() [L171] CALL assume_abort_if_not(var_1_50 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L171] RET assume_abort_if_not(var_1_50 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] CALL assume_abort_if_not(var_1_50 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L172] RET assume_abort_if_not(var_1_50 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=16, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L173] var_1_51 = __VERIFIER_nondet_char() [L174] CALL assume_abort_if_not(var_1_51 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L174] RET assume_abort_if_not(var_1_51 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] CALL assume_abort_if_not(var_1_51 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L175] RET assume_abort_if_not(var_1_51 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L190] RET updateVariables() [L191] CALL step() [L60] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L61] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L64] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L65] COND FALSE !(\read(var_1_7)) [L68] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L70] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L73] var_1_32 = var_1_16 [L74] var_1_30 = var_1_32 [L75] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L76] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L76] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L77] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L79] COND TRUE var_1_11 >= var_1_30 [L80] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L82] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L82] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L83] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L91] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L92] COND TRUE ! var_1_7 [L93] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L101] EXPR var_1_15 ^ var_1_1 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L101] EXPR var_1_13 | var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=8, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L101] COND FALSE !((var_1_15 ^ var_1_1) < (var_1_13 | var_1_13)) [L104] var_1_33 = (((((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) < 0 ) ? -((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) : ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_40=167/20, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L106] COND FALSE !((-32 & var_1_16) > var_1_32) [L109] var_1_40 = (var_1_18 + var_1_18) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L111] COND FALSE !(var_1_21 >= ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=50, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L118] COND TRUE var_1_21 <= (var_1_20 + var_1_19) [L119] var_1_45 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L122] COND FALSE !(var_1_18 > (var_1_19 + var_1_22)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=1, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L129] var_1_48 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=-16, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L130] COND FALSE !(var_1_20 < var_1_22) [L133] var_1_49 = ((((((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) > (var_1_27)) ? (((((var_1_50) < (var_1_51)) ? (var_1_50) : (var_1_51)))) : (var_1_27))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=256, var_1_54=5/4, var_1_55=5, var_1_7=0] [L135] var_1_53 = var_1_11 [L136] var_1_54 = var_1_21 [L137] var_1_55 = var_1_11 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=0, var_1_54=506, var_1_55=0, var_1_7=0] [L191] RET step() [L192] CALL, EXPR property() [L182] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=0, var_1_54=506, var_1_55=0, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=0, var_1_54=506, var_1_55=0, var_1_7=0] [L182] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=0, var_1_54=506, var_1_55=0, var_1_7=0] [L182] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=0, var_1_54=506, var_1_55=0, var_1_7=0] [L182-L183] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=0, var_1_54=506, var_1_55=0, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=0, var_1_16=0, var_1_17=505, var_1_1=64, var_1_21=506, var_1_22=505, var_1_24=0, var_1_26=32, var_1_27=3, var_1_28=29, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=0, var_1_33=0, var_1_45=0, var_1_46=0, var_1_47=127, var_1_48=0, var_1_49=4, var_1_50=4, var_1_51=5, var_1_53=0, var_1_54=506, var_1_55=0, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.2s, OverallIterations: 25, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5026 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5026 mSDsluCounter, 15453 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11036 mSDsCounter, 400 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5535 IncrementalHoareTripleChecker+Invalid, 5935 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 400 mSolverCounterUnsat, 4417 mSDtfsCounter, 5535 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1311 GetRequests, 1164 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=589occurred in iteration=23, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 4175 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 4029 NumberOfCodeBlocks, 4029 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3842 ConstructedInterpolants, 0 QuantifiedInterpolants, 13076 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 22176/22176 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 05:49:06,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.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 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:49:08,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:49:08,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 05:49:08,431 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:49:08,431 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:49:08,455 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:49:08,456 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:49:08,456 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:49:08,456 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:49:08,456 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:49:08,457 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:49:08,457 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:49:08,457 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:49:08,457 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:49:08,457 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:49:08,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:49:08,457 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 05:49:08,458 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:49:08,459 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:49:08,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:49:08,459 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:49:08,460 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 05:49:08,460 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 05:49:08,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:49:08,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:49:08,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:49:08,460 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:49:08,460 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 -> 6d2a5db81174f97af5617a328e4f08c7a29d4a33d2f456761417e8dc5d1b805e [2024-11-07 05:49:08,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:49:08,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:49:08,697 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:49:08,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:49:08,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:49:08,700 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2024-11-07 05:49:09,874 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:49:10,091 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:49:10,092 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2024-11-07 05:49:10,105 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2405940e7/d09759da84fc45dea3b1ff330f33882e/FLAGde2171b90 [2024-11-07 05:49:10,121 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2405940e7/d09759da84fc45dea3b1ff330f33882e [2024-11-07 05:49:10,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:49:10,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:49:10,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:49:10,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:49:10,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:49:10,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54989a92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10, skipping insertion in model container [2024-11-07 05:49:10,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:49:10,269 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2024-11-07 05:49:10,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:49:10,340 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:49:10,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i[919,932] [2024-11-07 05:49:10,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:49:10,391 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:49:10,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10 WrapperNode [2024-11-07 05:49:10,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:49:10,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:49:10,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:49:10,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:49:10,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,408 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,433 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-07 05:49:10,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:49:10,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:49:10,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:49:10,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:49:10,440 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,440 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,443 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,451 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:49:10,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,452 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,459 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,462 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,465 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,468 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:49:10,468 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:49:10,468 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:49:10,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:49:10,469 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (1/1) ... [2024-11-07 05:49:10,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:49:10,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:49:10,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:49:10,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:49:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:49:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 05:49:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:49:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:49:10,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:49:10,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:49:10,610 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:49:10,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:49:16,628 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-07 05:49:16,628 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:49:16,635 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:49:16,635 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:49:16,636 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:49:16 BoogieIcfgContainer [2024-11-07 05:49:16,636 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:49:16,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:49:16,638 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:49:16,641 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:49:16,641 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:49:10" (1/3) ... [2024-11-07 05:49:16,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc6edfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:49:16, skipping insertion in model container [2024-11-07 05:49:16,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:49:10" (2/3) ... [2024-11-07 05:49:16,642 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc6edfc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:49:16, skipping insertion in model container [2024-11-07 05:49:16,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:49:16" (3/3) ... [2024-11-07 05:49:16,643 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-63.i [2024-11-07 05:49:16,653 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:49:16,653 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:49:16,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:49:16,699 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;@7322d70a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:49:16,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:49:16,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:49:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 05:49:16,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:16,716 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:16,717 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:16,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -485067979, now seen corresponding path program 1 times [2024-11-07 05:49:16,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:16,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1630720154] [2024-11-07 05:49:16,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:16,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:16,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:16,734 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:49:16,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 05:49:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:17,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 05:49:17,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:49:17,296 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-07 05:49:17,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:49:17,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:49:17,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1630720154] [2024-11-07 05:49:17,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1630720154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:17,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:17,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:49:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028004890] [2024-11-07 05:49:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:17,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:49:17,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:49:17,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:49:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:49:17,321 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:49:17,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:17,352 INFO L93 Difference]: Finished difference Result 148 states and 254 transitions. [2024-11-07 05:49:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:49:17,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 151 [2024-11-07 05:49:17,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:17,360 INFO L225 Difference]: With dead ends: 148 [2024-11-07 05:49:17,360 INFO L226 Difference]: Without dead ends: 73 [2024-11-07 05:49:17,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:49:17,367 INFO L432 NwaCegarLoop]: 110 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, 110 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:17,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:49:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-07 05:49:17,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-07 05:49:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 49 states have (on average 1.346938775510204) internal successors, (66), 49 states have internal predecessors, (66), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-07 05:49:17,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 110 transitions. [2024-11-07 05:49:17,400 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 110 transitions. Word has length 151 [2024-11-07 05:49:17,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:17,400 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 110 transitions. [2024-11-07 05:49:17,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-07 05:49:17,401 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 110 transitions. [2024-11-07 05:49:17,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 05:49:17,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:17,403 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:17,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 05:49:17,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:17,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:17,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:17,604 INFO L85 PathProgramCache]: Analyzing trace with hash -750621503, now seen corresponding path program 1 times [2024-11-07 05:49:17,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:17,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176456019] [2024-11-07 05:49:17,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:17,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:17,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:17,607 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:49:17,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 05:49:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:18,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-07 05:49:18,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:49:19,540 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:19,540 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:49:19,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:49:19,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176456019] [2024-11-07 05:49:19,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176456019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:19,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:19,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:49:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503458287] [2024-11-07 05:49:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:19,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 05:49:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:49:19,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 05:49:19,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:49:19,543 INFO L87 Difference]: Start difference. First operand 73 states and 110 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:22,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:26,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.91s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:26,194 INFO L93 Difference]: Finished difference Result 214 states and 325 transitions. [2024-11-07 05:49:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 05:49:26,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-07 05:49:26,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:26,223 INFO L225 Difference]: With dead ends: 214 [2024-11-07 05:49:26,224 INFO L226 Difference]: Without dead ends: 144 [2024-11-07 05:49:26,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 05:49:26,226 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 77 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:26,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 358 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2024-11-07 05:49:26,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-07 05:49:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 116. [2024-11-07 05:49:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 69 states have internal predecessors, (86), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 05:49:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2024-11-07 05:49:26,247 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 151 [2024-11-07 05:49:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:26,247 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2024-11-07 05:49:26,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2024-11-07 05:49:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 05:49:26,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:26,249 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:26,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 05:49:26,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:26,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:26,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:26,451 INFO L85 PathProgramCache]: Analyzing trace with hash -531766785, now seen corresponding path program 1 times [2024-11-07 05:49:26,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719619033] [2024-11-07 05:49:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:26,452 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:26,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:26,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:49:26,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 05:49:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:26,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:49:26,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:49:26,946 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:26,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:49:26,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:49:26,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719619033] [2024-11-07 05:49:26,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719619033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:26,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:26,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:49:26,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516954450] [2024-11-07 05:49:26,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:26,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:49:26,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:49:26,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:49:26,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:26,948 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:31,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:31,119 INFO L93 Difference]: Finished difference Result 212 states and 320 transitions. [2024-11-07 05:49:31,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:49:31,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-07 05:49:31,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:31,121 INFO L225 Difference]: With dead ends: 212 [2024-11-07 05:49:31,121 INFO L226 Difference]: Without dead ends: 142 [2024-11-07 05:49:31,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:31,122 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 31 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:31,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 227 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-07 05:49:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-07 05:49:31,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 124. [2024-11-07 05:49:31,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 77 states have internal predecessors, (97), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 05:49:31,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 185 transitions. [2024-11-07 05:49:31,133 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 185 transitions. Word has length 151 [2024-11-07 05:49:31,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:31,134 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 185 transitions. [2024-11-07 05:49:31,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:31,134 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 185 transitions. [2024-11-07 05:49:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 05:49:31,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:31,135 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:31,153 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 (4)] Forceful destruction successful, exit code 0 [2024-11-07 05:49:31,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:31,336 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:31,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:31,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2074256769, now seen corresponding path program 1 times [2024-11-07 05:49:31,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:31,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966443461] [2024-11-07 05:49:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:31,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:31,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:49:31,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 05:49:31,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:31,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-07 05:49:31,781 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 05:49:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-07 05:49:31,830 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 05:49:31,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 05:49:31,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966443461] [2024-11-07 05:49:31,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966443461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:49:31,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:49:31,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 05:49:31,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85181559] [2024-11-07 05:49:31,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:49:31,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 05:49:31,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 05:49:31,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 05:49:31,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:31,833 INFO L87 Difference]: Start difference. First operand 124 states and 185 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:34,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 05:49:34,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:49:34,886 INFO L93 Difference]: Finished difference Result 206 states and 306 transitions. [2024-11-07 05:49:34,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 05:49:34,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 151 [2024-11-07 05:49:34,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:49:34,898 INFO L225 Difference]: With dead ends: 206 [2024-11-07 05:49:34,898 INFO L226 Difference]: Without dead ends: 128 [2024-11-07 05:49:34,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 05:49:34,899 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 43 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:49:34,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 180 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 05:49:34,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-07 05:49:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-07 05:49:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 05:49:34,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 187 transitions. [2024-11-07 05:49:34,914 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 187 transitions. Word has length 151 [2024-11-07 05:49:34,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:49:34,914 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 187 transitions. [2024-11-07 05:49:34,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-07 05:49:34,914 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 187 transitions. [2024-11-07 05:49:34,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-07 05:49:34,917 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:49:34,917 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:49:34,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 05:49:35,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:35,118 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:49:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:49:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1519645949, now seen corresponding path program 1 times [2024-11-07 05:49:35,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 05:49:35,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458178785] [2024-11-07 05:49:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:49:35,119 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 05:49:35,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 05:49:35,121 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 05:49:35,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 05:49:35,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:49:35,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-07 05:49:35,552 INFO L278 TraceCheckSpWp]: Computing forward predicates...