./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.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', '84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:26:07,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:26:07,533 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 06:26:07,537 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:26:07,537 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:26:07,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:26:07,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:26:07,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:26:07,556 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:26:07,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:26:07,557 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:26:07,557 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:26:07,557 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:26:07,557 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:26:07,557 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:26:07,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:26:07,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:26:07,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:26:07,558 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:26:07,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:26:07,559 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:26:07,559 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-11-07 06:26:07,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:26:07,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:26:07,844 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:26:07,845 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:26:07,845 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:26:07,847 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-07 06:26:09,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:26:09,263 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:26:09,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-07 06:26:09,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83da31712/d2c8d2c71e644338851b8258a56072ad/FLAG411322947 [2024-11-07 06:26:09,593 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/83da31712/d2c8d2c71e644338851b8258a56072ad [2024-11-07 06:26:09,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:26:09,596 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:26:09,597 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:26:09,597 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:26:09,600 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:26:09,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63439a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09, skipping insertion in model container [2024-11-07 06:26:09,601 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:26:09,722 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-07 06:26:09,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:26:09,801 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:26:09,813 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-07 06:26:09,837 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:26:09,852 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:26:09,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09 WrapperNode [2024-11-07 06:26:09,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:26:09,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:26:09,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:26:09,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:26:09,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,903 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-11-07 06:26:09,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:26:09,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:26:09,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:26:09,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:26:09,916 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,946 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 06:26:09,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,968 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:26:09,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:26:09,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:26:09,969 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:26:09,970 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (1/1) ... [2024-11-07 06:26:09,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:26:09,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:26:09,998 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 06:26:10,000 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 06:26:10,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:26:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:26:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:26:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 06:26:10,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:26:10,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:26:10,084 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:26:10,086 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:26:10,560 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-07 06:26:10,561 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:26:10,570 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:26:10,570 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:26:10,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:26:10 BoogieIcfgContainer [2024-11-07 06:26:10,571 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:26:10,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:26:10,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:26:10,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:26:10,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:26:09" (1/3) ... [2024-11-07 06:26:10,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26807c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:26:10, skipping insertion in model container [2024-11-07 06:26:10,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:09" (2/3) ... [2024-11-07 06:26:10,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26807c1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:26:10, skipping insertion in model container [2024-11-07 06:26:10,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:26:10" (3/3) ... [2024-11-07 06:26:10,581 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-07 06:26:10,593 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:26:10,593 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:26:10,642 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:26:10,651 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;@716732d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:26:10,651 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:26:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:26:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:26:10,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:10,665 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:10,665 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:10,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1493245153, now seen corresponding path program 1 times [2024-11-07 06:26:10,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:10,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051682963] [2024-11-07 06:26:10,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:26:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:26:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:26:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:26:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:26:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:26:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:26:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:26:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:26:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:26:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:26:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:26:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:26:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:26:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:26:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:26:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:26:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:26:10,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:26:10,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:26:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:10,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:26:10,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051682963] [2024-11-07 06:26:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051682963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:26:10,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671866860] [2024-11-07 06:26:10,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:10,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:26:10,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:26:11,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:26:11,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:26:11,017 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:26:11,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:11,044 INFO L93 Difference]: Finished difference Result 205 states and 346 transitions. [2024-11-07 06:26:11,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:26:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 140 [2024-11-07 06:26:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:11,077 INFO L225 Difference]: With dead ends: 205 [2024-11-07 06:26:11,077 INFO L226 Difference]: Without dead ends: 102 [2024-11-07 06:26:11,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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 06:26:11,084 INFO L432 NwaCegarLoop]: 157 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, 157 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 06:26:11,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:26:11,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-07 06:26:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-07 06:26:11,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:26:11,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 157 transitions. [2024-11-07 06:26:11,130 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 157 transitions. Word has length 140 [2024-11-07 06:26:11,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:11,131 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 157 transitions. [2024-11-07 06:26:11,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:26:11,131 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 157 transitions. [2024-11-07 06:26:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:26:11,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:11,135 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:11,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 06:26:11,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:11,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash 810771495, now seen corresponding path program 1 times [2024-11-07 06:26:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:11,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457998303] [2024-11-07 06:26:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:26:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:26:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:26:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:26:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:26:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:26:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:26:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:26:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:26:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:26:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:26:11,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:26:11,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:26:11,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:26:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:26:11,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:26:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:26:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:26:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:26:11,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:26:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:11,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:26:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457998303] [2024-11-07 06:26:11,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457998303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:11,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:11,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 06:26:11,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339339248] [2024-11-07 06:26:11,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:11,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 06:26:11,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:26:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 06:26:11,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 06:26:11,439 INFO L87 Difference]: Start difference. First operand 102 states and 157 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:11,542 INFO L93 Difference]: Finished difference Result 282 states and 435 transitions. [2024-11-07 06:26:11,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 06:26:11,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-07 06:26:11,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:11,546 INFO L225 Difference]: With dead ends: 282 [2024-11-07 06:26:11,547 INFO L226 Difference]: Without dead ends: 183 [2024-11-07 06:26:11,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 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 06:26:11,550 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 135 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:11,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 374 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 06:26:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-07 06:26:11,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 135. [2024-11-07 06:26:11,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 113 states have (on average 1.4601769911504425) internal successors, (165), 113 states have internal predecessors, (165), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:26:11,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 205 transitions. [2024-11-07 06:26:11,569 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 205 transitions. Word has length 140 [2024-11-07 06:26:11,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:11,572 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 205 transitions. [2024-11-07 06:26:11,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:11,573 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 205 transitions. [2024-11-07 06:26:11,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 06:26:11,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:11,574 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:11,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 06:26:11,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:11,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:11,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2090525731, now seen corresponding path program 1 times [2024-11-07 06:26:11,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:11,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318946121] [2024-11-07 06:26:11,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:11,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:26:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:11,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:26:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:26:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:26:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:26:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:26:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:26:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:26:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:26:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:26:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:26:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:26:12,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:26:12,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:26:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:26:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:26:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:26:12,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:26:12,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:26:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:26:12,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:12,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:26:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318946121] [2024-11-07 06:26:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318946121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:12,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:12,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:26:12,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135053283] [2024-11-07 06:26:12,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:12,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:26:12,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:26:12,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:26:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:26:12,095 INFO L87 Difference]: Start difference. First operand 135 states and 205 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:12,390 INFO L93 Difference]: Finished difference Result 429 states and 656 transitions. [2024-11-07 06:26:12,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:26:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 140 [2024-11-07 06:26:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:12,394 INFO L225 Difference]: With dead ends: 429 [2024-11-07 06:26:12,394 INFO L226 Difference]: Without dead ends: 297 [2024-11-07 06:26:12,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:26:12,396 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 221 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:12,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 448 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:26:12,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-07 06:26:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 254. [2024-11-07 06:26:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 211 states have (on average 1.4360189573459716) internal successors, (303), 211 states have internal predecessors, (303), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 06:26:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 383 transitions. [2024-11-07 06:26:12,425 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 383 transitions. Word has length 140 [2024-11-07 06:26:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:12,426 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 383 transitions. [2024-11-07 06:26:12,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 383 transitions. [2024-11-07 06:26:12,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-07 06:26:12,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:12,430 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:12,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 06:26:12,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:12,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:12,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1312378167, now seen corresponding path program 1 times [2024-11-07 06:26:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:12,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505295894] [2024-11-07 06:26:12,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:12,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:26:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:26:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:26:12,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:26:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:26:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:26:12,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:26:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:26:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:26:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:26:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:26:12,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:26:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:26:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:26:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:26:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:26:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:26:12,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:26:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:26:12,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:26:12,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:26:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505295894] [2024-11-07 06:26:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505295894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:12,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 06:26:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333287327] [2024-11-07 06:26:12,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 06:26:12,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:26:12,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 06:26:13,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:26:13,000 INFO L87 Difference]: Start difference. First operand 254 states and 383 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:13,573 INFO L93 Difference]: Finished difference Result 699 states and 1046 transitions. [2024-11-07 06:26:13,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:26:13,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-07 06:26:13,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:13,577 INFO L225 Difference]: With dead ends: 699 [2024-11-07 06:26:13,577 INFO L226 Difference]: Without dead ends: 448 [2024-11-07 06:26:13,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:26:13,581 INFO L432 NwaCegarLoop]: 209 mSDtfsCounter, 246 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:13,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 602 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:26:13,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-07 06:26:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 383. [2024-11-07 06:26:13,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 319 states have (on average 1.3918495297805642) internal successors, (444), 319 states have internal predecessors, (444), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:26:13,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 564 transitions. [2024-11-07 06:26:13,618 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 564 transitions. Word has length 141 [2024-11-07 06:26:13,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:13,618 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 564 transitions. [2024-11-07 06:26:13,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:13,618 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 564 transitions. [2024-11-07 06:26:13,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 06:26:13,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:13,619 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:13,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 06:26:13,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:13,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:13,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1235136882, now seen corresponding path program 1 times [2024-11-07 06:26:13,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:13,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784758451] [2024-11-07 06:26:13,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:13,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:26:13,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:26:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:26:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:26:13,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:26:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:26:13,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:26:13,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:26:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:26:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:26:13,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:26:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:26:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:26:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:26:13,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:26:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:26:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:26:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:26:13,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:26:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:26:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:13,915 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:13,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:26:13,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784758451] [2024-11-07 06:26:13,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784758451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:13,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:13,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:26:13,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688652917] [2024-11-07 06:26:13,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:13,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 06:26:13,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:26:13,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 06:26:13,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 06:26:13,921 INFO L87 Difference]: Start difference. First operand 383 states and 564 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:13,992 INFO L93 Difference]: Finished difference Result 804 states and 1187 transitions. [2024-11-07 06:26:13,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 06:26:13,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-07 06:26:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:13,997 INFO L225 Difference]: With dead ends: 804 [2024-11-07 06:26:13,998 INFO L226 Difference]: Without dead ends: 424 [2024-11-07 06:26:14,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 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 06:26:14,000 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 102 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:14,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 530 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:26:14,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-11-07 06:26:14,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 383. [2024-11-07 06:26:14,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 319 states have (on average 1.3667711598746082) internal successors, (436), 319 states have internal predecessors, (436), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:26:14,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 556 transitions. [2024-11-07 06:26:14,029 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 556 transitions. Word has length 142 [2024-11-07 06:26:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:14,030 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 556 transitions. [2024-11-07 06:26:14,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:14,030 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 556 transitions. [2024-11-07 06:26:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 06:26:14,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:14,032 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 06:26:14,032 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:14,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:14,032 INFO L85 PathProgramCache]: Analyzing trace with hash -685559033, now seen corresponding path program 1 times [2024-11-07 06:26:14,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:14,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094754088] [2024-11-07 06:26:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:14,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:26:14,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:26:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:26:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:26:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:26:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:26:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:26:14,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:26:14,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:26:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:26:14,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:26:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:26:14,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:26:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:26:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:26:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:26:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:26:14,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:26:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:26:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:26:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:14,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:26:14,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094754088] [2024-11-07 06:26:14,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094754088] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:14,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:14,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 06:26:14,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851320227] [2024-11-07 06:26:14,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:14,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:26:14,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:26:14,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:26:14,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:26:14,262 INFO L87 Difference]: Start difference. First operand 383 states and 556 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:14,587 INFO L93 Difference]: Finished difference Result 656 states and 965 transitions. [2024-11-07 06:26:14,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 06:26:14,588 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 145 [2024-11-07 06:26:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:14,591 INFO L225 Difference]: With dead ends: 656 [2024-11-07 06:26:14,591 INFO L226 Difference]: Without dead ends: 524 [2024-11-07 06:26:14,592 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:26:14,592 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 261 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:14,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 748 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 06:26:14,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2024-11-07 06:26:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 403. [2024-11-07 06:26:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 339 states have (on average 1.3775811209439528) internal successors, (467), 339 states have internal predecessors, (467), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-07 06:26:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 587 transitions. [2024-11-07 06:26:14,629 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 587 transitions. Word has length 145 [2024-11-07 06:26:14,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:14,630 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 587 transitions. [2024-11-07 06:26:14,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 587 transitions. [2024-11-07 06:26:14,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 06:26:14,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:14,632 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:14,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 06:26:14,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:14,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:14,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1167894651, now seen corresponding path program 1 times [2024-11-07 06:26:14,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:14,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119260775] [2024-11-07 06:26:14,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:14,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 06:26:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 06:26:19,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 06:26:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 06:26:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-07 06:26:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-07 06:26:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 06:26:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-07 06:26:19,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-07 06:26:19,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-07 06:26:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-07 06:26:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-07 06:26:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-07 06:26:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-07 06:26:19,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-07 06:26:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 06:26:19,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-07 06:26:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 06:26:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 06:26:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-07 06:26:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:19,881 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:19,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 06:26:19,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119260775] [2024-11-07 06:26:19,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119260775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:19,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:19,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-07 06:26:19,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254787832] [2024-11-07 06:26:19,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:19,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 06:26:19,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 06:26:19,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 06:26:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-07 06:26:19,883 INFO L87 Difference]: Start difference. First operand 403 states and 587 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:22,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:22,237 INFO L93 Difference]: Finished difference Result 1073 states and 1542 transitions. [2024-11-07 06:26:22,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:26:22,239 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 146 [2024-11-07 06:26:22,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:22,243 INFO L225 Difference]: With dead ends: 1073 [2024-11-07 06:26:22,243 INFO L226 Difference]: Without dead ends: 802 [2024-11-07 06:26:22,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-07 06:26:22,247 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 229 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:22,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 567 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 06:26:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2024-11-07 06:26:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 731. [2024-11-07 06:26:22,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 658 states have (on average 1.3920972644376899) internal successors, (916), 661 states have internal predecessors, (916), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-07 06:26:22,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1048 transitions. [2024-11-07 06:26:22,304 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1048 transitions. Word has length 146 [2024-11-07 06:26:22,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:22,305 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1048 transitions. [2024-11-07 06:26:22,305 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1048 transitions. [2024-11-07 06:26:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-07 06:26:22,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:22,307 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:22,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 06:26:22,307 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:22,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:22,308 INFO L85 PathProgramCache]: Analyzing trace with hash 218308743, now seen corresponding path program 1 times [2024-11-07 06:26:22,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 06:26:22,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170132070] [2024-11-07 06:26:22,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:22,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 06:26:22,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 06:26:22,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [41533567] [2024-11-07 06:26:22,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:22,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:26:22,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:26:22,383 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 06:26:22,385 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 06:26:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:26:22,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 06:26:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 06:26:22,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 06:26:22,690 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 06:26:22,691 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 06:26:22,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:26:22,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 06:26:22,896 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 06:26:22,980 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 06:26:22,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:26:22 BoogieIcfgContainer [2024-11-07 06:26:22,985 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 06:26:22,986 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 06:26:22,986 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 06:26:22,986 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 06:26:22,986 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:26:10" (3/4) ... [2024-11-07 06:26:22,988 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 06:26:22,989 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 06:26:22,990 INFO L158 Benchmark]: Toolchain (without parser) took 13393.52ms. Allocated memory was 109.1MB in the beginning and 276.8MB in the end (delta: 167.8MB). Free memory was 85.5MB in the beginning and 109.1MB in the end (delta: -23.6MB). Peak memory consumption was 144.4MB. Max. memory is 16.1GB. [2024-11-07 06:26:22,990 INFO L158 Benchmark]: CDTParser took 0.68ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:26:22,990 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.58ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 69.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 06:26:22,990 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.49ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 64.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:26:22,990 INFO L158 Benchmark]: Boogie Preprocessor took 60.39ms. Allocated memory is still 109.1MB. Free memory was 64.0MB in the beginning and 56.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 06:26:22,990 INFO L158 Benchmark]: RCFGBuilder took 601.65ms. Allocated memory is still 109.1MB. Free memory was 56.3MB in the beginning and 66.7MB in the end (delta: -10.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. [2024-11-07 06:26:22,991 INFO L158 Benchmark]: TraceAbstraction took 12410.11ms. Allocated memory was 109.1MB in the beginning and 276.8MB in the end (delta: 167.8MB). Free memory was 66.2MB in the beginning and 109.2MB in the end (delta: -43.0MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. [2024-11-07 06:26:22,991 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 276.8MB. Free memory was 109.2MB in the beginning and 109.1MB in the end (delta: 67.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 06:26:22,992 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.68ms. Allocated memory is still 83.9MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.58ms. Allocated memory is still 109.1MB. Free memory was 85.4MB in the beginning and 69.7MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.49ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 64.0MB in the end (delta: 5.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.39ms. Allocated memory is still 109.1MB. Free memory was 64.0MB in the beginning and 56.3MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 601.65ms. Allocated memory is still 109.1MB. Free memory was 56.3MB in the beginning and 66.7MB in the end (delta: -10.5MB). Peak memory consumption was 31.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12410.11ms. Allocated memory was 109.1MB in the beginning and 276.8MB in the end (delta: 167.8MB). Free memory was 66.2MB in the beginning and 109.2MB in the end (delta: -43.0MB). Peak memory consumption was 130.1MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 276.8MB. Free memory was 109.2MB in the beginning and 109.1MB 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 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L55] COND TRUE ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) >= var_1_12 [L56] var_1_37 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L58] var_1_20 = var_1_8 [L59] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L60] COND TRUE (var_1_20 / var_1_12) < var_1_13 [L61] var_1_29 = var_1_12 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L65] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L72] var_1_38 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L74] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L77] COND FALSE !(\read(var_1_22)) [L82] var_1_24 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L84] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L87] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L88] COND FALSE !(\read(var_1_22)) [L95] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L97] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L104] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L106] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L107] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L108] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L109] COND FALSE !(\read(var_1_22)) [L116] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L121] signed long int stepLocal_4 = 256; [L122] unsigned char stepLocal_3 = var_1_22; [L123] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L124] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L127] COND FALSE !(stepLocal_3 || var_1_22) [L132] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=-193, var_1_14=-193, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=63, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 8, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1194 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1194 mSDsluCounter, 3426 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1982 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1398 IncrementalHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 1444 mSDtfsCounter, 1398 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 353 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=731occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 389 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1286 NumberOfCodeBlocks, 1286 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 10854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5320/5320 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 06:26:23,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 06:26:24,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 06:26:24,956 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 06:26:24,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 06:26:24,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 06:26:24,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 06:26:24,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 06:26:24,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 06:26:24,990 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 06:26:24,990 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 06:26:24,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 06:26:24,991 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 06:26:24,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 06:26:24,991 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 06:26:24,991 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 06:26:24,992 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 06:26:24,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 06:26:24,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 06:26:24,993 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:26:24,994 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 06:26:24,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 06:26:24,994 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-11-07 06:26:25,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 06:26:25,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 06:26:25,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 06:26:25,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 06:26:25,248 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 06:26:25,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-07 06:26:26,462 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 06:26:26,706 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 06:26:26,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-07 06:26:26,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0819ede44/2e3dd192815a41c4b9fbe45d101c99cc/FLAG8646d6803 [2024-11-07 06:26:27,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0819ede44/2e3dd192815a41c4b9fbe45d101c99cc [2024-11-07 06:26:27,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 06:26:27,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 06:26:27,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 06:26:27,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 06:26:27,059 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 06:26:27,060 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5cf0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27, skipping insertion in model container [2024-11-07 06:26:27,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,076 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 06:26:27,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-07 06:26:27,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:26:27,273 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 06:26:27,281 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-11-07 06:26:27,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 06:26:27,318 INFO L204 MainTranslator]: Completed translation [2024-11-07 06:26:27,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27 WrapperNode [2024-11-07 06:26:27,319 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 06:26:27,320 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 06:26:27,320 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 06:26:27,320 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 06:26:27,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,372 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-07 06:26:27,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 06:26:27,373 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 06:26:27,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 06:26:27,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 06:26:27,386 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,393 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,405 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 06:26:27,405 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,405 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 06:26:27,437 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 06:26:27,437 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 06:26:27,437 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 06:26:27,439 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (1/1) ... [2024-11-07 06:26:27,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 06:26:27,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 06:26:27,468 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 06:26:27,471 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 06:26:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 06:26:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 06:26:27,491 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 06:26:27,492 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 06:26:27,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 06:26:27,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 06:26:27,575 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 06:26:27,576 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 06:26:34,120 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-07 06:26:34,121 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 06:26:34,130 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 06:26:34,130 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 06:26:34,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:26:34 BoogieIcfgContainer [2024-11-07 06:26:34,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 06:26:34,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 06:26:34,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 06:26:34,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 06:26:34,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:26:27" (1/3) ... [2024-11-07 06:26:34,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68da9768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:26:34, skipping insertion in model container [2024-11-07 06:26:34,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:26:27" (2/3) ... [2024-11-07 06:26:34,139 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68da9768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:26:34, skipping insertion in model container [2024-11-07 06:26:34,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:26:34" (3/3) ... [2024-11-07 06:26:34,140 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-11-07 06:26:34,151 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 06:26:34,151 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 06:26:34,197 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 06:26:34,209 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;@23130823, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 06:26:34,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 06:26:34,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:26:34,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 06:26:34,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:34,222 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:34,223 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:34,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2060441151, now seen corresponding path program 1 times [2024-11-07 06:26:34,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:26:34,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743048362] [2024-11-07 06:26:34,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:34,234 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:34,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:26:34,238 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:26:34,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 06:26:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:34,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 06:26:34,598 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:26:34,634 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-07 06:26:34,634 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:26:34,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:26:34,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743048362] [2024-11-07 06:26:34,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743048362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:34,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:34,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 06:26:34,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413005055] [2024-11-07 06:26:34,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:34,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 06:26:34,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:26:34,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 06:26:34,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 06:26:34,656 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:26:34,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:34,673 INFO L93 Difference]: Finished difference Result 143 states and 248 transitions. [2024-11-07 06:26:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 06:26:34,675 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-11-07 06:26:34,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:34,680 INFO L225 Difference]: With dead ends: 143 [2024-11-07 06:26:34,680 INFO L226 Difference]: Without dead ends: 71 [2024-11-07 06:26:34,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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 06:26:34,684 INFO L432 NwaCegarLoop]: 109 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, 109 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 06:26:34,684 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 06:26:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-07 06:26:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-07 06:26:34,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 49 states have (on average 1.4081632653061225) internal successors, (69), 49 states have internal predecessors, (69), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:26:34,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 109 transitions. [2024-11-07 06:26:34,716 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 109 transitions. Word has length 136 [2024-11-07 06:26:34,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:34,716 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 109 transitions. [2024-11-07 06:26:34,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-07 06:26:34,716 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 109 transitions. [2024-11-07 06:26:34,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 06:26:34,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:34,719 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:34,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-07 06:26:34,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:34,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:34,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:34,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1195479351, now seen corresponding path program 1 times [2024-11-07 06:26:34,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:26:34,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693740577] [2024-11-07 06:26:34,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:34,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:34,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:26:34,927 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:26:34,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 06:26:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:35,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:26:35,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:26:35,823 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-07 06:26:35,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 06:26:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-07 06:26:36,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:26:36,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693740577] [2024-11-07 06:26:36,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [693740577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 06:26:36,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 06:26:36,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-07 06:26:36,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144123755] [2024-11-07 06:26:36,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 06:26:36,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 06:26:36,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:26:36,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 06:26:36,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 06:26:36,656 INFO L87 Difference]: Start difference. First operand 71 states and 109 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 06:26:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:37,814 INFO L93 Difference]: Finished difference Result 144 states and 216 transitions. [2024-11-07 06:26:37,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 06:26:37,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 136 [2024-11-07 06:26:37,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:37,816 INFO L225 Difference]: With dead ends: 144 [2024-11-07 06:26:37,816 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 06:26:37,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-07 06:26:37,817 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 111 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:37,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 157 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 06:26:37,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 06:26:37,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2024-11-07 06:26:37,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 49 states have internal predecessors, (61), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:26:37,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 101 transitions. [2024-11-07 06:26:37,828 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 101 transitions. Word has length 136 [2024-11-07 06:26:37,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:37,828 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 101 transitions. [2024-11-07 06:26:37,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-07 06:26:37,828 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 101 transitions. [2024-11-07 06:26:37,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-07 06:26:37,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:37,829 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:37,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 06:26:38,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:38,030 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:38,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:38,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1948431163, now seen corresponding path program 1 times [2024-11-07 06:26:38,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:26:38,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012115677] [2024-11-07 06:26:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:38,031 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:38,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:26:38,035 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:26:38,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 06:26:38,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:38,328 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-07 06:26:38,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:26:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:39,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:26:39,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:26:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012115677] [2024-11-07 06:26:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012115677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:39,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:39,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:26:39,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096777613] [2024-11-07 06:26:39,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:39,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:26:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:26:39,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:26:39,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:26:39,614 INFO L87 Difference]: Start difference. First operand 72 states and 101 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:40,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:40,442 INFO L93 Difference]: Finished difference Result 186 states and 264 transitions. [2024-11-07 06:26:40,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:26:40,442 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-07 06:26:40,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:40,445 INFO L225 Difference]: With dead ends: 186 [2024-11-07 06:26:40,446 INFO L226 Difference]: Without dead ends: 117 [2024-11-07 06:26:40,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 06:26:40,447 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 86 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:40,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 315 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 06:26:40,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-07 06:26:40,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2024-11-07 06:26:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 49 states have internal predecessors, (59), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-07 06:26:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 99 transitions. [2024-11-07 06:26:40,472 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 99 transitions. Word has length 136 [2024-11-07 06:26:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:40,472 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 99 transitions. [2024-11-07 06:26:40,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 99 transitions. [2024-11-07 06:26:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-07 06:26:40,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:40,474 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:40,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 06:26:40,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:40,675 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:40,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:40,675 INFO L85 PathProgramCache]: Analyzing trace with hash 856281452, now seen corresponding path program 1 times [2024-11-07 06:26:40,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:26:40,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992702107] [2024-11-07 06:26:40,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:40,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:40,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:26:40,678 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:26:40,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 06:26:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:40,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-07 06:26:40,976 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 06:26:43,451 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-07 06:26:43,451 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 06:26:43,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 06:26:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992702107] [2024-11-07 06:26:43,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992702107] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 06:26:43,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 06:26:43,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 06:26:43,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557668578] [2024-11-07 06:26:43,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 06:26:43,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 06:26:43,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 06:26:43,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 06:26:43,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 06:26:43,453 INFO L87 Difference]: Start difference. First operand 72 states and 99 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:44,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 06:26:44,022 INFO L93 Difference]: Finished difference Result 217 states and 298 transitions. [2024-11-07 06:26:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 06:26:44,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-07 06:26:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 06:26:44,025 INFO L225 Difference]: With dead ends: 217 [2024-11-07 06:26:44,025 INFO L226 Difference]: Without dead ends: 148 [2024-11-07 06:26:44,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-07 06:26:44,027 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 72 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 06:26:44,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 307 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 06:26:44,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-07 06:26:44,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 139. [2024-11-07 06:26:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 94 states have (on average 1.202127659574468) internal successors, (113), 94 states have internal predecessors, (113), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 06:26:44,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 193 transitions. [2024-11-07 06:26:44,061 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 193 transitions. Word has length 137 [2024-11-07 06:26:44,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 06:26:44,062 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 193 transitions. [2024-11-07 06:26:44,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-07 06:26:44,062 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 193 transitions. [2024-11-07 06:26:44,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-07 06:26:44,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 06:26:44,063 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:26:44,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 06:26:44,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:44,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 06:26:44,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 06:26:44,264 INFO L85 PathProgramCache]: Analyzing trace with hash 830270148, now seen corresponding path program 1 times [2024-11-07 06:26:44,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 06:26:44,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [510224371] [2024-11-07 06:26:44,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 06:26:44,265 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 06:26:44,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 06:26:44,267 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 06:26:44,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-07 06:26:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 06:26:44,702 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-07 06:26:44,707 INFO L278 TraceCheckSpWp]: Computing forward predicates...