./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.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_loopvsstraightlinecode_100-while_file-53.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', '3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8'] 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_loopvsstraightlinecode_100-while_file-53.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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:11:22,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:11:22,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 08:11:22,512 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:11:22,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:11:22,526 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:11:22,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:11:22,527 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:11:22,527 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:11:22,527 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:11:22,527 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:11:22,527 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:11:22,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:11:22,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:11:22,527 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:11:22,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:11:22,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:11:22,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:11:22,529 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:11:22,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:11:22,529 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-07 08:11:22,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:11:22,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:11:22,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:11:22,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:11:22,797 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:11:22,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-07 08:11:24,015 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:11:24,238 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:11:24,239 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-07 08:11:24,246 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae5d82b1d/f4093e4853464f4095ea6de2f74ca56c/FLAGfda79e629 [2024-11-07 08:11:24,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ae5d82b1d/f4093e4853464f4095ea6de2f74ca56c [2024-11-07 08:11:24,571 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:11:24,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:11:24,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:11:24,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:11:24,577 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:11:24,577 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,578 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@308b1086 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24, skipping insertion in model container [2024-11-07 08:11:24,578 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:11:24,693 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-07 08:11:24,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:11:24,774 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:11:24,782 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-07 08:11:24,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:11:24,836 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:11:24,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24 WrapperNode [2024-11-07 08:11:24,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:11:24,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:11:24,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:11:24,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:11:24,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,856 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,911 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-11-07 08:11:24,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:11:24,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:11:24,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:11:24,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:11:24,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,958 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 08:11:24,958 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,958 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,980 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:24,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:11:24,993 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:11:24,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:11:24,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:11:24,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (1/1) ... [2024-11-07 08:11:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:11:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:11:25,026 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 08:11:25,029 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 08:11:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:11:25,047 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:11:25,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:11:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 08:11:25,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:11:25,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:11:25,149 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:11:25,151 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 08:11:25,605 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-07 08:11:25,605 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 08:11:25,613 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 08:11:25,614 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 08:11:25,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:11:25 BoogieIcfgContainer [2024-11-07 08:11:25,614 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 08:11:25,616 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 08:11:25,616 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 08:11:25,620 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 08:11:25,620 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 08:11:24" (1/3) ... [2024-11-07 08:11:25,621 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1361aaf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:11:25, skipping insertion in model container [2024-11-07 08:11:25,621 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:11:24" (2/3) ... [2024-11-07 08:11:25,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1361aaf5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 08:11:25, skipping insertion in model container [2024-11-07 08:11:25,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:11:25" (3/3) ... [2024-11-07 08:11:25,623 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-07 08:11:25,634 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 08:11:25,634 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 08:11:25,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 08:11:25,688 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;@1eb8990a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 08:11:25,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 08:11:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 08:11:25,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 08:11:25,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:25,701 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:25,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:25,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:25,705 INFO L85 PathProgramCache]: Analyzing trace with hash -531509665, now seen corresponding path program 1 times [2024-11-07 08:11:25,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:25,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237006964] [2024-11-07 08:11:25,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:25,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:26,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:26,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:26,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:26,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:26,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:26,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:26,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237006964] [2024-11-07 08:11:26,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237006964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:26,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:26,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 08:11:26,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512845493] [2024-11-07 08:11:26,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:26,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 08:11:26,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:26,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 08:11:26,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 08:11:26,197 INFO L87 Difference]: Start difference. First operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 08:11:26,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:26,222 INFO L93 Difference]: Finished difference Result 185 states and 317 transitions. [2024-11-07 08:11:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 08:11:26,224 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-07 08:11:26,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:26,229 INFO L225 Difference]: With dead ends: 185 [2024-11-07 08:11:26,229 INFO L226 Difference]: Without dead ends: 92 [2024-11-07 08:11:26,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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 08:11:26,234 INFO L432 NwaCegarLoop]: 142 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, 142 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 08:11:26,234 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:11:26,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-07 08:11:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-07 08:11:26,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 08:11:26,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2024-11-07 08:11:26,270 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 170 [2024-11-07 08:11:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:26,271 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2024-11-07 08:11:26,272 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, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 08:11:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2024-11-07 08:11:26,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 08:11:26,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:26,277 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:26,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 08:11:26,277 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:26,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:26,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1528999847, now seen corresponding path program 1 times [2024-11-07 08:11:26,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:26,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610600193] [2024-11-07 08:11:26,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:26,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:26,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:26,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:26,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:26,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:26,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:26,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:26,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:27,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:27,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:27,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:27,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:27,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:27,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610600193] [2024-11-07 08:11:27,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610600193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:27,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:27,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:11:27,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183926868] [2024-11-07 08:11:27,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:27,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:11:27,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:27,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:11:27,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:11:27,038 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:27,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:27,114 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-11-07 08:11:27,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:11:27,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-07 08:11:27,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:27,119 INFO L225 Difference]: With dead ends: 230 [2024-11-07 08:11:27,119 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 08:11:27,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:11:27,120 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 64 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:27,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:11:27,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 08:11:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-07 08:11:27,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 104 states have internal predecessors, (148), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-07 08:11:27,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2024-11-07 08:11:27,143 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 170 [2024-11-07 08:11:27,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:27,143 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2024-11-07 08:11:27,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:27,143 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2024-11-07 08:11:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 08:11:27,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:27,148 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:27,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 08:11:27,149 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:27,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:27,149 INFO L85 PathProgramCache]: Analyzing trace with hash 246007515, now seen corresponding path program 1 times [2024-11-07 08:11:27,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:27,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041147704] [2024-11-07 08:11:27,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:27,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:33,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:33,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:33,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:33,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:33,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:33,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:33,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:33,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:33,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:33,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:33,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041147704] [2024-11-07 08:11:33,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041147704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:33,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:33,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-07 08:11:33,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413253007] [2024-11-07 08:11:33,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:33,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-07 08:11:33,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:33,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-07 08:11:33,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:11:33,746 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:37,938 INFO L93 Difference]: Finished difference Result 616 states and 938 transitions. [2024-11-07 08:11:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 08:11:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-07 08:11:37,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:37,944 INFO L225 Difference]: With dead ends: 616 [2024-11-07 08:11:37,944 INFO L226 Difference]: Without dead ends: 482 [2024-11-07 08:11:37,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2024-11-07 08:11:37,946 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 743 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:37,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 747 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-07 08:11:37,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-07 08:11:37,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 215. [2024-11-07 08:11:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 155 states have internal predecessors, (217), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 08:11:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 329 transitions. [2024-11-07 08:11:37,975 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 329 transitions. Word has length 170 [2024-11-07 08:11:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:37,976 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 329 transitions. [2024-11-07 08:11:37,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:37,976 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 329 transitions. [2024-11-07 08:11:37,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 08:11:37,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:37,977 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:37,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 08:11:37,977 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:37,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:37,978 INFO L85 PathProgramCache]: Analyzing trace with hash -12157923, now seen corresponding path program 1 times [2024-11-07 08:11:37,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:37,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411517015] [2024-11-07 08:11:37,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:37,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:41,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:41,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:41,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:41,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:41,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:41,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:41,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:41,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:41,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:41,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411517015] [2024-11-07 08:11:41,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411517015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:41,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:41,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-07 08:11:41,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641251117] [2024-11-07 08:11:41,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:41,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 08:11:41,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:41,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 08:11:41,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-07 08:11:41,663 INFO L87 Difference]: Start difference. First operand 215 states and 329 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 08:11:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:45,253 INFO L93 Difference]: Finished difference Result 606 states and 928 transitions. [2024-11-07 08:11:45,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 08:11:45,253 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-07 08:11:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:45,256 INFO L225 Difference]: With dead ends: 606 [2024-11-07 08:11:45,256 INFO L226 Difference]: Without dead ends: 472 [2024-11-07 08:11:45,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-11-07 08:11:45,261 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 622 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:45,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 864 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 08:11:45,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-07 08:11:45,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 240. [2024-11-07 08:11:45,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 08:11:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-07 08:11:45,288 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-07 08:11:45,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:45,289 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-07 08:11:45,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 08:11:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-07 08:11:45,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-07 08:11:45,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:45,290 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:45,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 08:11:45,291 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:45,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -765109735, now seen corresponding path program 1 times [2024-11-07 08:11:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:45,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009358179] [2024-11-07 08:11:45,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:45,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:46,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:46,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:46,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:46,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:46,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:46,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:46,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:46,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:47,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:47,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:47,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:47,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:47,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:47,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:47,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009358179] [2024-11-07 08:11:47,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009358179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:47,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:47,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 08:11:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765952222] [2024-11-07 08:11:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:47,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:11:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:11:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:11:47,017 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:48,287 INFO L93 Difference]: Finished difference Result 555 states and 853 transitions. [2024-11-07 08:11:48,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:11:48,288 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-07 08:11:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:48,290 INFO L225 Difference]: With dead ends: 555 [2024-11-07 08:11:48,290 INFO L226 Difference]: Without dead ends: 421 [2024-11-07 08:11:48,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-07 08:11:48,292 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 447 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:48,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 566 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 08:11:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-07 08:11:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 240. [2024-11-07 08:11:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 08:11:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-07 08:11:48,319 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-07 08:11:48,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:48,320 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-07 08:11:48,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:48,320 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-07 08:11:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 08:11:48,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:48,322 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:48,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 08:11:48,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:48,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:48,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1278840773, now seen corresponding path program 1 times [2024-11-07 08:11:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:48,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333539242] [2024-11-07 08:11:48,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:48,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:48,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:48,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:48,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:48,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:48,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:48,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333539242] [2024-11-07 08:11:48,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333539242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:48,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:48,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:11:48,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718765737] [2024-11-07 08:11:48,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:48,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:11:48,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:11:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:11:48,789 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:49,239 INFO L93 Difference]: Finished difference Result 657 states and 1010 transitions. [2024-11-07 08:11:49,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:11:49,239 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-07 08:11:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:49,242 INFO L225 Difference]: With dead ends: 657 [2024-11-07 08:11:49,242 INFO L226 Difference]: Without dead ends: 523 [2024-11-07 08:11:49,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-07 08:11:49,244 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 316 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:49,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 1164 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 08:11:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-07 08:11:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 274. [2024-11-07 08:11:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 213 states have (on average 1.4694835680751173) internal successors, (313), 214 states have internal predecessors, (313), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 08:11:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 425 transitions. [2024-11-07 08:11:49,263 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 425 transitions. Word has length 171 [2024-11-07 08:11:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:49,264 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 425 transitions. [2024-11-07 08:11:49,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 425 transitions. [2024-11-07 08:11:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 08:11:49,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:49,265 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:49,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 08:11:49,266 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:49,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1020675335, now seen corresponding path program 1 times [2024-11-07 08:11:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:49,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382249817] [2024-11-07 08:11:49,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:49,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:50,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:50,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:50,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:50,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:50,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:50,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:50,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:50,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382249817] [2024-11-07 08:11:50,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382249817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:50,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:50,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 08:11:50,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610823696] [2024-11-07 08:11:50,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:50,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 08:11:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:50,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 08:11:50,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-07 08:11:50,687 INFO L87 Difference]: Start difference. First operand 274 states and 425 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:51,800 INFO L93 Difference]: Finished difference Result 724 states and 1123 transitions. [2024-11-07 08:11:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 08:11:51,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-07 08:11:51,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:51,803 INFO L225 Difference]: With dead ends: 724 [2024-11-07 08:11:51,805 INFO L226 Difference]: Without dead ends: 590 [2024-11-07 08:11:51,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:11:51,807 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 253 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:51,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 601 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 08:11:51,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-07 08:11:51,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 314. [2024-11-07 08:11:51,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 253 states have (on average 1.4940711462450593) internal successors, (378), 254 states have internal predecessors, (378), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 08:11:51,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 490 transitions. [2024-11-07 08:11:51,826 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 490 transitions. Word has length 171 [2024-11-07 08:11:51,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:51,829 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 490 transitions. [2024-11-07 08:11:51,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 490 transitions. [2024-11-07 08:11:51,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 08:11:51,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:51,843 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:51,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 08:11:51,843 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:51,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:51,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1144827267, now seen corresponding path program 1 times [2024-11-07 08:11:51,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:51,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773991236] [2024-11-07 08:11:51,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:51,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:51,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:51,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:51,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:51,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:51,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:51,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:51,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:51,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773991236] [2024-11-07 08:11:51,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773991236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:51,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:51,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:11:51,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731485421] [2024-11-07 08:11:51,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:51,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:11:51,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:51,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:11:51,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:11:51,961 INFO L87 Difference]: Start difference. First operand 314 states and 490 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:52,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:11:52,062 INFO L93 Difference]: Finished difference Result 732 states and 1140 transitions. [2024-11-07 08:11:52,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 08:11:52,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-07 08:11:52,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:11:52,066 INFO L225 Difference]: With dead ends: 732 [2024-11-07 08:11:52,066 INFO L226 Difference]: Without dead ends: 552 [2024-11-07 08:11:52,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 08:11:52,067 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 138 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:11:52,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 427 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:11:52,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2024-11-07 08:11:52,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 441. [2024-11-07 08:11:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 369 states have (on average 1.4878048780487805) internal successors, (549), 372 states have internal predecessors, (549), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:11:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 677 transitions. [2024-11-07 08:11:52,086 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 677 transitions. Word has length 171 [2024-11-07 08:11:52,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:11:52,087 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 677 transitions. [2024-11-07 08:11:52,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:11:52,087 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 677 transitions. [2024-11-07 08:11:52,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 08:11:52,091 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:11:52,091 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:11:52,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 08:11:52,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:11:52,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:11:52,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2147292940, now seen corresponding path program 1 times [2024-11-07 08:11:52,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:11:52,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366167195] [2024-11-07 08:11:52,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:11:52,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:11:52,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:11:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:11:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:11:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:11:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:11:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:11:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:11:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:11:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:11:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:11:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:11:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:11:56,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:11:56,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:11:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:11:56,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:11:56,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:11:56,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:11:56,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:11:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:11:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:11:56,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:11:56,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:11:56,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:11:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:11:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:11:56,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:11:56,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:11:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366167195] [2024-11-07 08:11:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366167195] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:11:56,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:11:56,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-07 08:11:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513647290] [2024-11-07 08:11:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:11:56,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-07 08:11:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:11:56,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-07 08:11:56,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-07 08:11:56,522 INFO L87 Difference]: Start difference. First operand 441 states and 677 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 08:12:00,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:00,913 INFO L93 Difference]: Finished difference Result 1439 states and 2189 transitions. [2024-11-07 08:12:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-07 08:12:00,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 171 [2024-11-07 08:12:00,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:00,918 INFO L225 Difference]: With dead ends: 1439 [2024-11-07 08:12:00,918 INFO L226 Difference]: Without dead ends: 1182 [2024-11-07 08:12:00,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2024-11-07 08:12:00,920 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1180 mSDsluCounter, 885 mSDsCounter, 0 mSdLazyCounter, 1593 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1180 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:00,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1180 Valid, 1038 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1593 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-07 08:12:00,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-07 08:12:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 458. [2024-11-07 08:12:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 386 states have (on average 1.494818652849741) internal successors, (577), 389 states have internal predecessors, (577), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:12:00,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 705 transitions. [2024-11-07 08:12:00,945 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 705 transitions. Word has length 171 [2024-11-07 08:12:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:00,946 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 705 transitions. [2024-11-07 08:12:00,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 08:12:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 705 transitions. [2024-11-07 08:12:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-07 08:12:00,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:00,948 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:00,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 08:12:00,948 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:00,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:00,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1889508918, now seen corresponding path program 1 times [2024-11-07 08:12:00,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:00,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199703848] [2024-11-07 08:12:00,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:00,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:12:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:12:02,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:12:02,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:12:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:12:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:12:02,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:12:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:12:02,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:12:02,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:12:02,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:12:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:12:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:12:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:12:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:12:02,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:12:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:12:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:12:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:12:02,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:12:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:12:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:12:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:12:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:12:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:12:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:02,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:12:02,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:12:02,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199703848] [2024-11-07 08:12:02,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199703848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:12:02,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:12:02,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 08:12:02,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371985783] [2024-11-07 08:12:02,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:12:02,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 08:12:02,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:12:02,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 08:12:02,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-07 08:12:02,515 INFO L87 Difference]: Start difference. First operand 458 states and 705 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:03,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:03,685 INFO L93 Difference]: Finished difference Result 1164 states and 1781 transitions. [2024-11-07 08:12:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 08:12:03,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-07 08:12:03,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:03,690 INFO L225 Difference]: With dead ends: 1164 [2024-11-07 08:12:03,690 INFO L226 Difference]: Without dead ends: 907 [2024-11-07 08:12:03,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-07 08:12:03,694 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 311 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:03,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 573 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 08:12:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-07 08:12:03,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 443. [2024-11-07 08:12:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 371 states have (on average 1.4878706199460916) internal successors, (552), 374 states have internal predecessors, (552), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:12:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 680 transitions. [2024-11-07 08:12:03,718 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 680 transitions. Word has length 171 [2024-11-07 08:12:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:03,718 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 680 transitions. [2024-11-07 08:12:03,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 680 transitions. [2024-11-07 08:12:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 08:12:03,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:03,720 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:03,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 08:12:03,721 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:03,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:03,721 INFO L85 PathProgramCache]: Analyzing trace with hash -929825386, now seen corresponding path program 1 times [2024-11-07 08:12:03,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:03,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395721179] [2024-11-07 08:12:03,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:03,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:12:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:12:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:12:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:12:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:12:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:12:04,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:12:04,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:12:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:12:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:12:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:12:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:12:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:12:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:12:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:12:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:12:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:12:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:12:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:12:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:12:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:12:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:12:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:12:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:12:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:12:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 08:12:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:12:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395721179] [2024-11-07 08:12:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395721179] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:12:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [704623905] [2024-11-07 08:12:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:04,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:12:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:12:04,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:12:04,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-07 08:12:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:04,554 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 08:12:04,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:12:04,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-07 08:12:04,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:12:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 08:12:05,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [704623905] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:12:05,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:12:05,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 21 [2024-11-07 08:12:05,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898563879] [2024-11-07 08:12:05,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:12:05,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-07 08:12:05,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:12:05,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-07 08:12:05,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-07 08:12:05,050 INFO L87 Difference]: Start difference. First operand 443 states and 680 transitions. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-07 08:12:07,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:07,602 INFO L93 Difference]: Finished difference Result 2256 states and 3315 transitions. [2024-11-07 08:12:07,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-07 08:12:07,603 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 172 [2024-11-07 08:12:07,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:07,609 INFO L225 Difference]: With dead ends: 2256 [2024-11-07 08:12:07,609 INFO L226 Difference]: Without dead ends: 1919 [2024-11-07 08:12:07,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1056, Invalid=6254, Unknown=0, NotChecked=0, Total=7310 [2024-11-07 08:12:07,613 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 2153 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2165 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 2191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:07,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2165 Valid, 1508 Invalid, 2191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 08:12:07,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2024-11-07 08:12:07,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 606. [2024-11-07 08:12:07,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 529 states have (on average 1.440453686200378) internal successors, (762), 532 states have internal predecessors, (762), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:12:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 890 transitions. [2024-11-07 08:12:07,653 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 890 transitions. Word has length 172 [2024-11-07 08:12:07,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:07,653 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 890 transitions. [2024-11-07 08:12:07,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-07 08:12:07,654 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 890 transitions. [2024-11-07 08:12:07,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 08:12:07,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:07,655 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:07,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 08:12:07,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-07 08:12:07,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:07,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:07,856 INFO L85 PathProgramCache]: Analyzing trace with hash 81291864, now seen corresponding path program 1 times [2024-11-07 08:12:07,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485141261] [2024-11-07 08:12:07,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:07,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:12:08,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:12:08,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:12:08,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:12:08,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:12:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:12:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:12:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:12:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:12:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:12:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:12:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:12:08,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:12:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:12:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:12:08,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:12:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:12:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:12:08,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:12:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:12:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:12:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:12:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:12:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:12:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:12:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 08:12:08,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:12:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485141261] [2024-11-07 08:12:08,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485141261] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 08:12:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43082596] [2024-11-07 08:12:08,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:08,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:12:08,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:12:08,276 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:12:08,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-07 08:12:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:08,380 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-07 08:12:08,383 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:12:08,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-07 08:12:08,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:12:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-07 08:12:09,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43082596] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:12:09,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-07 08:12:09,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2024-11-07 08:12:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911507968] [2024-11-07 08:12:09,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-07 08:12:09,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-07 08:12:09,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:12:09,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-07 08:12:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-07 08:12:09,300 INFO L87 Difference]: Start difference. First operand 606 states and 890 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-07 08:12:10,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:10,331 INFO L93 Difference]: Finished difference Result 1364 states and 1972 transitions. [2024-11-07 08:12:10,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-07 08:12:10,332 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 172 [2024-11-07 08:12:10,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:10,336 INFO L225 Difference]: With dead ends: 1364 [2024-11-07 08:12:10,336 INFO L226 Difference]: Without dead ends: 977 [2024-11-07 08:12:10,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2024-11-07 08:12:10,338 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 1127 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:10,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 982 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:12:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-07 08:12:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 571. [2024-11-07 08:12:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 493 states have (on average 1.4198782961460445) internal successors, (700), 496 states have internal predecessors, (700), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:12:10,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2024-11-07 08:12:10,380 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 172 [2024-11-07 08:12:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:10,381 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2024-11-07 08:12:10,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-07 08:12:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2024-11-07 08:12:10,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 08:12:10,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:10,382 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:10,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-07 08:12:10,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:12:10,583 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:10,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 677651176, now seen corresponding path program 1 times [2024-11-07 08:12:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:10,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671788462] [2024-11-07 08:12:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:10,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:12:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:12:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:12:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:12:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:12:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:12:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:12:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:12:10,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:12:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:12:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:12:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:12:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:12:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:12:10,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:12:10,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:12:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:12:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:12:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:12:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:12:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:12:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:12:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:12:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:12:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:12:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:12:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:12:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671788462] [2024-11-07 08:12:10,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671788462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:12:10,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:12:10,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 08:12:10,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102567084] [2024-11-07 08:12:10,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:12:10,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 08:12:10,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:12:10,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 08:12:10,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:12:10,722 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:10,831 INFO L93 Difference]: Finished difference Result 982 states and 1429 transitions. [2024-11-07 08:12:10,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 08:12:10,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-07 08:12:10,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:10,833 INFO L225 Difference]: With dead ends: 982 [2024-11-07 08:12:10,833 INFO L226 Difference]: Without dead ends: 585 [2024-11-07 08:12:10,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 08:12:10,837 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:10,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 369 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 08:12:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-07 08:12:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2024-11-07 08:12:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 501 states have (on average 1.4131736526946108) internal successors, (708), 504 states have internal predecessors, (708), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:12:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 836 transitions. [2024-11-07 08:12:10,863 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 836 transitions. Word has length 172 [2024-11-07 08:12:10,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:10,863 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 836 transitions. [2024-11-07 08:12:10,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:10,864 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 836 transitions. [2024-11-07 08:12:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-07 08:12:10,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:10,866 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:10,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 08:12:10,866 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:10,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -157194738, now seen corresponding path program 1 times [2024-11-07 08:12:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810738384] [2024-11-07 08:12:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:12:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:12:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:12:12,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:12:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:12:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:12:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:12:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:12:12,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:12:12,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:12:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:12:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:12:12,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:12:12,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:12:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:12:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:12:12,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:12:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:12:12,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:12:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:12:12,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:12:12,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:12:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:12:12,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:12:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:12:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:12,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:12:12,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:12:12,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810738384] [2024-11-07 08:12:12,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810738384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:12:12,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:12:12,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 08:12:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180197517] [2024-11-07 08:12:12,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:12:12,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 08:12:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:12:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 08:12:12,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-07 08:12:12,189 INFO L87 Difference]: Start difference. First operand 579 states and 836 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:12,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:12,969 INFO L93 Difference]: Finished difference Result 1442 states and 2092 transitions. [2024-11-07 08:12:12,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 08:12:12,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-07 08:12:12,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:12,978 INFO L225 Difference]: With dead ends: 1442 [2024-11-07 08:12:12,979 INFO L226 Difference]: Without dead ends: 1089 [2024-11-07 08:12:12,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 08:12:12,980 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 369 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:12,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 472 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 08:12:12,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-07 08:12:13,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 577. [2024-11-07 08:12:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 499 states have (on average 1.4128256513026052) internal successors, (705), 502 states have internal predecessors, (705), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:12:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 833 transitions. [2024-11-07 08:12:13,012 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 833 transitions. Word has length 172 [2024-11-07 08:12:13,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:13,012 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 833 transitions. [2024-11-07 08:12:13,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 833 transitions. [2024-11-07 08:12:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 08:12:13,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:13,014 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:13,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 08:12:13,014 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:13,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:13,015 INFO L85 PathProgramCache]: Analyzing trace with hash 496607426, now seen corresponding path program 1 times [2024-11-07 08:12:13,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:13,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020431942] [2024-11-07 08:12:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:13,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:12:13,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944086577] [2024-11-07 08:12:13,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:13,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:12:13,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:12:13,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:12:13,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-07 08:12:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:13,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-07 08:12:13,319 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 08:12:15,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 602 proven. 159 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-07 08:12:15,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 08:12:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 111 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-07 08:12:18,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:12:18,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020431942] [2024-11-07 08:12:18,094 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-07 08:12:18,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944086577] [2024-11-07 08:12:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944086577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 08:12:18,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 08:12:18,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 39 [2024-11-07 08:12:18,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197519943] [2024-11-07 08:12:18,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 08:12:18,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-07 08:12:18,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:12:18,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-07 08:12:18,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=1177, Unknown=0, NotChecked=0, Total=1482 [2024-11-07 08:12:18,097 INFO L87 Difference]: Start difference. First operand 577 states and 833 transitions. Second operand has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 37 states have internal predecessors, (122), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-07 08:12:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:28,784 INFO L93 Difference]: Finished difference Result 2347 states and 3304 transitions. [2024-11-07 08:12:28,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-07 08:12:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 37 states have internal predecessors, (122), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) Word has length 173 [2024-11-07 08:12:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:28,790 INFO L225 Difference]: With dead ends: 2347 [2024-11-07 08:12:28,790 INFO L226 Difference]: Without dead ends: 1869 [2024-11-07 08:12:28,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3855 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=2332, Invalid=9224, Unknown=0, NotChecked=0, Total=11556 [2024-11-07 08:12:28,793 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1910 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 3025 mSolverCounterSat, 505 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1928 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 3530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 505 IncrementalHoareTripleChecker+Valid, 3025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:28,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1928 Valid, 1685 Invalid, 3530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [505 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-07 08:12:28,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2024-11-07 08:12:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 768. [2024-11-07 08:12:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 768 states, 682 states have (on average 1.401759530791789) internal successors, (956), 685 states have internal predecessors, (956), 64 states have call successors, (64), 21 states have call predecessors, (64), 21 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-07 08:12:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1084 transitions. [2024-11-07 08:12:28,840 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1084 transitions. Word has length 173 [2024-11-07 08:12:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:28,841 INFO L471 AbstractCegarLoop]: Abstraction has 768 states and 1084 transitions. [2024-11-07 08:12:28,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 3.210526315789474) internal successors, (122), 37 states have internal predecessors, (122), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-07 08:12:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1084 transitions. [2024-11-07 08:12:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 08:12:28,842 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:28,842 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:28,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-07 08:12:29,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:12:29,043 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:29,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1644732866, now seen corresponding path program 1 times [2024-11-07 08:12:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429360983] [2024-11-07 08:12:29,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:29,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 08:12:29,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 08:12:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 08:12:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 08:12:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 08:12:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 08:12:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 08:12:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 08:12:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 08:12:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 08:12:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 08:12:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 08:12:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 08:12:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 08:12:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 08:12:29,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 08:12:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 08:12:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-07 08:12:29,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 08:12:29,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 08:12:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 08:12:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 08:12:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-07 08:12:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 08:12:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-07 08:12:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 08:12:29,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-07 08:12:29,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 08:12:29,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429360983] [2024-11-07 08:12:29,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429360983] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 08:12:29,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 08:12:29,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 08:12:29,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361010973] [2024-11-07 08:12:29,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 08:12:29,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 08:12:29,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 08:12:29,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 08:12:29,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 08:12:29,195 INFO L87 Difference]: Start difference. First operand 768 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:29,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 08:12:29,269 INFO L93 Difference]: Finished difference Result 1680 states and 2369 transitions. [2024-11-07 08:12:29,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 08:12:29,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 173 [2024-11-07 08:12:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 08:12:29,275 INFO L225 Difference]: With dead ends: 1680 [2024-11-07 08:12:29,276 INFO L226 Difference]: Without dead ends: 1234 [2024-11-07 08:12:29,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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 08:12:29,277 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 75 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 08:12:29,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 269 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 08:12:29,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2024-11-07 08:12:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1222. [2024-11-07 08:12:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 1086 states have (on average 1.3941068139963169) internal successors, (1514), 1092 states have internal predecessors, (1514), 103 states have call successors, (103), 32 states have call predecessors, (103), 32 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-07 08:12:29,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1720 transitions. [2024-11-07 08:12:29,363 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1720 transitions. Word has length 173 [2024-11-07 08:12:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 08:12:29,363 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1720 transitions. [2024-11-07 08:12:29,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-07 08:12:29,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1720 transitions. [2024-11-07 08:12:29,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-07 08:12:29,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 08:12:29,365 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:12:29,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 08:12:29,365 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 08:12:29,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 08:12:29,365 INFO L85 PathProgramCache]: Analyzing trace with hash 964674496, now seen corresponding path program 1 times [2024-11-07 08:12:29,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 08:12:29,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982973244] [2024-11-07 08:12:29,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:29,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 08:12:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 08:12:29,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1945751565] [2024-11-07 08:12:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 08:12:29,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 08:12:29,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:12:29,623 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-07 08:12:29,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-07 08:12:29,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:12:29,748 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 08:12:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 08:12:29,878 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 08:12:29,878 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 08:12:29,879 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 08:12:29,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-07 08:12:30,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-07 08:12:30,083 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 08:12:30,178 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 08:12:30,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 08:12:30 BoogieIcfgContainer [2024-11-07 08:12:30,182 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 08:12:30,182 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 08:12:30,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 08:12:30,182 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 08:12:30,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 08:11:25" (3/4) ... [2024-11-07 08:12:30,185 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 08:12:30,186 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 08:12:30,186 INFO L158 Benchmark]: Toolchain (without parser) took 65613.55ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 91.7MB in the beginning and 228.3MB in the end (delta: -136.7MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2024-11-07 08:12:30,187 INFO L158 Benchmark]: CDTParser took 1.08ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:12:30,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.63ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 74.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 08:12:30,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.52ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 66.0MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:12:30,187 INFO L158 Benchmark]: Boogie Preprocessor took 78.47ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 50.4MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 08:12:30,188 INFO L158 Benchmark]: RCFGBuilder took 621.40ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 54.6MB in the end (delta: -4.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-07 08:12:30,188 INFO L158 Benchmark]: TraceAbstraction took 64565.96ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 54.1MB in the beginning and 228.4MB in the end (delta: -174.3MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. [2024-11-07 08:12:30,188 INFO L158 Benchmark]: Witness Printer took 3.29ms. Allocated memory is still 369.1MB. Free memory was 228.4MB in the beginning and 228.3MB in the end (delta: 67.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 08:12:30,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.08ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.63ms. Allocated memory is still 117.4MB. Free memory was 91.7MB in the beginning and 74.0MB in the end (delta: 17.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.52ms. Allocated memory is still 117.4MB. Free memory was 74.0MB in the beginning and 66.0MB in the end (delta: 8.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.47ms. Allocated memory is still 117.4MB. Free memory was 66.0MB in the beginning and 50.4MB in the end (delta: 15.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 621.40ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 54.6MB in the end (delta: -4.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 64565.96ms. Allocated memory was 117.4MB in the beginning and 369.1MB in the end (delta: 251.7MB). Free memory was 54.1MB in the beginning and 228.4MB in the end (delta: -174.3MB). Peak memory consumption was 70.5MB. Max. memory is 16.1GB. * Witness Printer took 3.29ms. Allocated memory is still 369.1MB. Free memory was 228.4MB in the beginning and 228.3MB in the end (delta: 67.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someUnaryDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -100; [L23] unsigned char var_1_2 = 200; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_7 = 16; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned short int var_1_17 = 256; [L34] signed short int var_1_19 = -100; [L35] signed short int var_1_20 = 32; [L36] unsigned char var_1_21 = 1; [L37] signed short int var_1_23 = -256; [L38] float var_1_24 = -0.5; [L39] float var_1_25 = 255.8; [L40] float var_1_26 = 31.2; [L41] float var_1_27 = 0.5; [L42] unsigned char var_1_28 = 32; [L43] unsigned char var_1_29 = 64; [L44] unsigned short int var_1_30 = 16; [L45] double var_1_31 = 255.9; [L46] unsigned short int var_1_33 = 39141; [L47] unsigned short int var_1_34 = 52589; [L48] signed long int last_1_var_1_1 = -100; [L49] unsigned char last_1_var_1_7 = 16; [L50] unsigned short int last_1_var_1_17 = 256; [L51] signed short int last_1_var_1_19 = -100; [L52] signed short int last_1_var_1_20 = 32; [L53] signed short int last_1_var_1_23 = -256; [L54] unsigned char last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_7 = var_1_7 [L186] last_1_var_1_17 = var_1_17 [L187] last_1_var_1_19 = var_1_19 [L188] last_1_var_1_20 = var_1_20 [L189] last_1_var_1_23 = var_1_23 [L190] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L151] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L164] var_1_25 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L165] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L167] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L169] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L171] RET assume_abort_if_not(var_1_29 >= 64) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L174] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 != 0.0F) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L179] var_1_34 = __VERIFIER_nondet_ushort() [L180] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L201] RET updateVariables() [L202] CALL step() [L58] COND FALSE !((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) [L67] var_1_1 = var_1_2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L69] unsigned char stepLocal_1 = last_1_var_1_28 < (var_1_3 - var_1_4); [L70] signed long int stepLocal_0 = last_1_var_1_28; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_1=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L71] COND TRUE stepLocal_1 || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L72] COND TRUE stepLocal_0 >= var_1_4 [L73] var_1_7 = 2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L80] unsigned char stepLocal_3 = var_1_4; [L81] signed long int stepLocal_2 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_2=256, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L82] COND FALSE !(stepLocal_2 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) [L89] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L91] var_1_24 = (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L92] COND TRUE ! var_1_12 [L93] var_1_28 = ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L97] COND TRUE (var_1_24 / var_1_31) > var_1_24 [L98] var_1_30 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L100] var_1_19 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] COND FALSE !(var_1_1 != (var_1_4 ^ var_1_1)) [L110] unsigned char stepLocal_6 = var_1_9; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_6=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L111] COND TRUE stepLocal_6 || (var_1_28 >= last_1_var_1_20) [L112] var_1_20 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L116] unsigned char stepLocal_8 = var_1_28 > var_1_7; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_8=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L117] COND TRUE stepLocal_8 || var_1_14 [L118] var_1_23 = (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L122] unsigned char stepLocal_7 = ((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_7=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L123] COND FALSE !(stepLocal_7 && var_1_13) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L128] signed short int stepLocal_5 = var_1_23; [L129] unsigned char stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L130] COND FALSE !((var_1_28 / (2571661009u - var_1_2)) != stepLocal_5) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L135] COND TRUE \read(var_1_21) [L136] var_1_17 = var_1_7 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193-L194] return (((((((((((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1)) && ((last_1_var_1_17 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? ((var_1_4 >= last_1_var_1_19) ? (var_1_14 == ((unsigned char) var_1_12)) : (var_1_14 == ((unsigned char) (var_1_15 && var_1_16)))) : (var_1_14 == ((unsigned char) var_1_15)))) && (((var_1_28 / (2571661009u - var_1_2)) != var_1_23) ? ((var_1_12 && var_1_21) ? (var_1_17 == ((unsigned short int) 2)) : 1) : (var_1_21 ? (var_1_17 == ((unsigned short int) var_1_7)) : (var_1_17 == ((unsigned short int) var_1_2))))) && (var_1_19 == ((signed short int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28)))))) && ((var_1_9 || (var_1_28 >= last_1_var_1_20)) ? (var_1_20 == ((signed short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4))) : (var_1_20 == ((signed short int) (var_1_4 - (((((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) < 0 ) ? -((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) : ((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3)))))))))) && (((((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0) && var_1_13) ? (var_1_14 ? (var_1_21 == ((unsigned char) var_1_16)) : 1) : 1)) && (((var_1_28 > var_1_7) || var_1_14) ? (var_1_23 == ((signed short int) (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))))) : (var_1_23 == ((signed short int) (var_1_2 - var_1_28))))) && (var_1_24 == ((float) (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27))))))) && ((! var_1_12) ? (var_1_28 == ((unsigned char) ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4))) : (var_1_28 == ((unsigned char) ((((((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) > (var_1_3)) ? (((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) : (var_1_3))))))) && (((var_1_24 / var_1_31) > var_1_24) ? (var_1_30 == ((unsigned short int) (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 64.4s, OverallIterations: 17, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 31.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9825 SdHoareTripleChecker+Valid, 19.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9767 mSDsluCounter, 11809 SdHoareTripleChecker+Invalid, 17.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9594 mSDsCounter, 1625 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12370 IncrementalHoareTripleChecker+Invalid, 13995 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1625 mSolverCounterUnsat, 2215 mSDtfsCounter, 12370 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2196 GetRequests, 1815 SyntacticMatches, 2 SemanticMatches, 379 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6947 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1222occurred in iteration=16, InterpolantAutomatonStates: 300, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 5858 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 29.0s InterpolantComputationTime, 3602 NumberOfCodeBlocks, 3602 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3579 ConstructedInterpolants, 0 QuantifiedInterpolants, 38896 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1256 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 24546/25200 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 08:12:30,400 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-07 08:12:30,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 08:12:32,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 08:12:32,276 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 08:12:32,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 08:12:32,281 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 08:12:32,301 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 08:12:32,302 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 08:12:32,302 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 08:12:32,302 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 08:12:32,302 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 08:12:32,302 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 08:12:32,302 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 08:12:32,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 08:12:32,302 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 08:12:32,302 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 08:12:32,303 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 08:12:32,303 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 08:12:32,303 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:12:32,304 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 08:12:32,304 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 08:12:32,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 08:12:32,307 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-07 08:12:32,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 08:12:32,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 08:12:32,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 08:12:32,581 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 08:12:32,583 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 08:12:32,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-07 08:12:33,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 08:12:34,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 08:12:34,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-07 08:12:34,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cd1842de/5a12a65112c044978f31bd53162fa3c8/FLAG9447b02d4 [2024-11-07 08:12:34,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5cd1842de/5a12a65112c044978f31bd53162fa3c8 [2024-11-07 08:12:34,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 08:12:34,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 08:12:34,065 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 08:12:34,065 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 08:12:34,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 08:12:34,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,070 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27c44b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34, skipping insertion in model container [2024-11-07 08:12:34,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 08:12:34,203 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-07 08:12:34,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:12:34,306 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 08:12:34,316 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_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-07 08:12:34,363 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 08:12:34,383 INFO L204 MainTranslator]: Completed translation [2024-11-07 08:12:34,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34 WrapperNode [2024-11-07 08:12:34,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 08:12:34,385 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 08:12:34,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 08:12:34,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 08:12:34,391 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,407 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,433 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-11-07 08:12:34,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 08:12:34,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 08:12:34,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 08:12:34,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 08:12:34,443 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,446 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,472 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 08:12:34,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,493 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,499 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 08:12:34,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 08:12:34,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 08:12:34,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 08:12:34,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 08:12:34" (1/1) ... [2024-11-07 08:12:34,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 08:12:34,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 08:12:34,539 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 08:12:34,543 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 08:12:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 08:12:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 08:12:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 08:12:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 08:12:34,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 08:12:34,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 08:12:34,630 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 08:12:34,632 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation