./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.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_codestructure_functionizing_file-9.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', 'b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be'] 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_codestructure_functionizing_file-9.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 b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:04:51,462 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:04:51,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 04:04:51,548 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:04:51,548 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:04:51,570 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:04:51,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:04:51,571 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:04:51,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:04:51,572 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:04:51,573 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:04:51,573 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:04:51,573 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:04:51,574 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:04:51,574 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:04:51,574 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:04:51,574 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:04:51,574 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:04:51,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 04:04:51,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:04:51,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:04:51,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:04:51,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:04:51,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:04:51,575 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:04:51,576 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:04:51,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:04:51,576 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:04:51,576 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:04:51,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:04:51,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:04:51,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:04:51,577 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:04:51,577 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:04:51,577 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:04:51,577 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:04:51,578 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 04:04:51,578 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 04:04:51,578 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:04:51,578 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:04:51,578 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:04:51,578 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:04:51,578 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 -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-11-07 04:04:51,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:04:51,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:04:51,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:04:51,873 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:04:51,874 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:04:51,874 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-07 04:04:53,191 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:04:53,449 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:04:53,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-07 04:04:53,459 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f9a49f35/7f49cc5ad1dd4fcbb6ce88a665a4da3b/FLAG7b7c65b28 [2024-11-07 04:04:53,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f9a49f35/7f49cc5ad1dd4fcbb6ce88a665a4da3b [2024-11-07 04:04:53,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:04:53,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:04:53,479 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:04:53,479 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:04:53,483 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:04:53,484 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,484 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@534f6c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53, skipping insertion in model container [2024-11-07 04:04:53,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,503 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:04:53,609 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_codestructure_functionizing_file-9.i[919,932] [2024-11-07 04:04:53,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:04:53,682 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:04:53,694 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_codestructure_functionizing_file-9.i[919,932] [2024-11-07 04:04:53,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:04:53,732 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:04:53,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53 WrapperNode [2024-11-07 04:04:53,733 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:04:53,734 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:04:53,734 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:04:53,734 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:04:53,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,769 INFO L138 Inliner]: procedures = 30, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 216 [2024-11-07 04:04:53,769 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:04:53,770 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:04:53,770 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:04:53,770 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:04:53,777 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,795 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 04:04:53,795 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,796 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,802 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,811 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:04:53,820 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:04:53,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:04:53,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:04:53,821 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (1/1) ... [2024-11-07 04:04:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:04:53,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:04:53,854 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 04:04:53,860 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 04:04:53,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:04:53,880 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:04:53,880 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:04:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 04:04:53,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:04:53,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:04:53,982 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:04:53,984 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:04:54,419 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-07 04:04:54,421 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:04:54,432 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:04:54,433 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:04:54,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:04:54 BoogieIcfgContainer [2024-11-07 04:04:54,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:04:54,436 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:04:54,436 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:04:54,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:04:54,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:04:53" (1/3) ... [2024-11-07 04:04:54,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b91712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:04:54, skipping insertion in model container [2024-11-07 04:04:54,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:04:53" (2/3) ... [2024-11-07 04:04:54,440 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b91712a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:04:54, skipping insertion in model container [2024-11-07 04:04:54,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:04:54" (3/3) ... [2024-11-07 04:04:54,442 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-11-07 04:04:54,453 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:04:54,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:04:54,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:04:54,527 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;@3f69d8bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:04:54,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:04:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 62 states have internal predecessors, (84), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:04:54,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 04:04:54,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:04:54,543 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:54,543 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:04:54,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:04:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1908118560, now seen corresponding path program 1 times [2024-11-07 04:04:54,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:04:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159401856] [2024-11-07 04:04:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:04:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:04:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:04:54,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:04:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:04:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:04:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:04:54,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:04:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:04:54,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:04:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:04:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:04:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:04:54,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:04:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:04:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:04:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:04:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:04:54,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:04:54,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:04:54,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:04:54,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:04:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:04:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:04:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:04:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159401856] [2024-11-07 04:04:54,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159401856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:04:54,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:04:54,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:04:54,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035289936] [2024-11-07 04:04:54,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:04:54,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:04:54,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:04:54,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:04:54,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:04:54,958 INFO L87 Difference]: Start difference. First operand has 85 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 62 states have internal predecessors, (84), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 04:04:54,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:04:54,984 INFO L93 Difference]: Finished difference Result 163 states and 267 transitions. [2024-11-07 04:04:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:04:54,987 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2024-11-07 04:04:54,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:04:54,995 INFO L225 Difference]: With dead ends: 163 [2024-11-07 04:04:54,995 INFO L226 Difference]: Without dead ends: 81 [2024-11-07 04:04:54,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 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 04:04:55,001 INFO L432 NwaCegarLoop]: 119 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, 119 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 04:04:55,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:04:55,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-07 04:04:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-07 04:04:55,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:04:55,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 119 transitions. [2024-11-07 04:04:55,045 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 119 transitions. Word has length 139 [2024-11-07 04:04:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:04:55,046 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 119 transitions. [2024-11-07 04:04:55,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-07 04:04:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 119 transitions. [2024-11-07 04:04:55,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-07 04:04:55,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:04:55,049 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:55,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 04:04:55,049 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:04:55,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:04:55,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1894686822, now seen corresponding path program 1 times [2024-11-07 04:04:55,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:04:55,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054647993] [2024-11-07 04:04:55,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:04:55,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:04:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:04:55,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:04:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:04:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:04:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:04:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:04:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:04:55,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:04:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:04:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:04:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:04:55,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:04:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:04:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:04:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:04:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:04:55,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:04:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:04:55,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:04:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:04:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:04:55,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:04:55,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:04:55,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054647993] [2024-11-07 04:04:55,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054647993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:04:55,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:04:55,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:04:55,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849115977] [2024-11-07 04:04:55,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:04:55,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:04:55,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:04:55,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:04:55,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:04:55,453 INFO L87 Difference]: Start difference. First operand 81 states and 119 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:04:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:04:55,489 INFO L93 Difference]: Finished difference Result 160 states and 237 transitions. [2024-11-07 04:04:55,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:04:55,490 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 139 [2024-11-07 04:04:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:04:55,493 INFO L225 Difference]: With dead ends: 160 [2024-11-07 04:04:55,494 INFO L226 Difference]: Without dead ends: 82 [2024-11-07 04:04:55,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 04:04:55,496 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:04:55,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:04:55,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-07 04:04:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-07 04:04:55,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:04:55,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2024-11-07 04:04:55,514 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 139 [2024-11-07 04:04:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:04:55,516 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2024-11-07 04:04:55,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:04:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2024-11-07 04:04:55,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:04:55,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:04:55,520 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:55,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 04:04:55,520 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:04:55,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:04:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1128868079, now seen corresponding path program 1 times [2024-11-07 04:04:55,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:04:55,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774229264] [2024-11-07 04:04:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:04:55,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:04:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:04:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:04:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:04:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:04:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:04:57,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:04:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:04:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:04:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:04:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:04:57,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:04:57,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:04:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:04:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:04:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:04:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:04:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:04:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:04:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:04:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:04:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:04:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:57,442 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:04:57,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:04:57,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774229264] [2024-11-07 04:04:57,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774229264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:04:57,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:04:57,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 04:04:57,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747917134] [2024-11-07 04:04:57,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:04:57,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:04:57,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:04:57,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:04:57,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:04:57,448 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:04:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:04:57,962 INFO L93 Difference]: Finished difference Result 248 states and 356 transitions. [2024-11-07 04:04:57,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:04:57,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-07 04:04:57,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:04:57,965 INFO L225 Difference]: With dead ends: 248 [2024-11-07 04:04:57,965 INFO L226 Difference]: Without dead ends: 169 [2024-11-07 04:04:57,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:04:57,967 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 129 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:04:57,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 541 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 04:04:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-07 04:04:57,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2024-11-07 04:04:57,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 112 states have (on average 1.375) internal successors, (154), 113 states have internal predecessors, (154), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:04:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 204 transitions. [2024-11-07 04:04:57,997 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 204 transitions. Word has length 140 [2024-11-07 04:04:57,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:04:57,998 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 204 transitions. [2024-11-07 04:04:57,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:04:57,999 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 204 transitions. [2024-11-07 04:04:58,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:04:58,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:04:58,001 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:58,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 04:04:58,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:04:58,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:04:58,004 INFO L85 PathProgramCache]: Analyzing trace with hash 107799725, now seen corresponding path program 1 times [2024-11-07 04:04:58,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:04:58,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243633096] [2024-11-07 04:04:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:04:58,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:04:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:04:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:04:58,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:04:58,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:04:58,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:04:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:04:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:04:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:04:58,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:04:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:04:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:04:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:04:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:04:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:04:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:04:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:04:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:04:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:04:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:04:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:04:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:04:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:04:58,858 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:04:58,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:04:58,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243633096] [2024-11-07 04:04:58,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243633096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:04:58,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:04:58,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 04:04:58,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560343340] [2024-11-07 04:04:58,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:04:58,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 04:04:58,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:04:58,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 04:04:58,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:04:58,860 INFO L87 Difference]: Start difference. First operand 140 states and 204 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:04:59,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:04:59,723 INFO L93 Difference]: Finished difference Result 308 states and 442 transitions. [2024-11-07 04:04:59,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:04:59,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-07 04:04:59,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:04:59,725 INFO L225 Difference]: With dead ends: 308 [2024-11-07 04:04:59,726 INFO L226 Difference]: Without dead ends: 171 [2024-11-07 04:04:59,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 04:04:59,727 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 104 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:04:59,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 771 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 04:04:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-07 04:04:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 124. [2024-11-07 04:04:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.34375) internal successors, (129), 97 states have internal predecessors, (129), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 04:04:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 179 transitions. [2024-11-07 04:04:59,757 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 179 transitions. Word has length 140 [2024-11-07 04:04:59,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:04:59,758 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 179 transitions. [2024-11-07 04:04:59,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:04:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 179 transitions. [2024-11-07 04:04:59,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:04:59,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:04:59,763 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:04:59,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 04:04:59,763 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:04:59,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:04:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash -459479823, now seen corresponding path program 1 times [2024-11-07 04:04:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:04:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859409048] [2024-11-07 04:04:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:04:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:04:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:05:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:05:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:05:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:05:00,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:05:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:05:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:05:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:05:00,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:05:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:00,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:05:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:05:01,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:05:01,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:05:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:05:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:05:01,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:05:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:05:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:05:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:05:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:05:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:05:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:05:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:05:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859409048] [2024-11-07 04:05:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859409048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:05:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:05:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 04:05:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196770001] [2024-11-07 04:05:01,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:05:01,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 04:05:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:05:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 04:05:01,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-07 04:05:01,028 INFO L87 Difference]: Start difference. First operand 124 states and 179 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:05:01,917 INFO L93 Difference]: Finished difference Result 297 states and 421 transitions. [2024-11-07 04:05:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:05:01,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-07 04:05:01,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:05:01,921 INFO L225 Difference]: With dead ends: 297 [2024-11-07 04:05:01,923 INFO L226 Difference]: Without dead ends: 176 [2024-11-07 04:05:01,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:05:01,925 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 94 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:05:01,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 658 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 04:05:01,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-07 04:05:01,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 150. [2024-11-07 04:05:01,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 119 states have (on average 1.3529411764705883) internal successors, (161), 121 states have internal predecessors, (161), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 04:05:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2024-11-07 04:05:01,963 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 140 [2024-11-07 04:05:01,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:05:01,964 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2024-11-07 04:05:01,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:01,964 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2024-11-07 04:05:01,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-07 04:05:01,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:01,966 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:01,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 04:05:01,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:01,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1480548177, now seen corresponding path program 1 times [2024-11-07 04:05:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:05:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820932837] [2024-11-07 04:05:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:05:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:05:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:05:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:05:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:05:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:05:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:05:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:05:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:05:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:05:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:05:02,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:05:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:05:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:05:02,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:05:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:05:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:05:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:05:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:05:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:05:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:05:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:05:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:02,597 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:05:02,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:05:02,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820932837] [2024-11-07 04:05:02,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820932837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:05:02,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:05:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 04:05:02,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890861454] [2024-11-07 04:05:02,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:05:02,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 04:05:02,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:05:02,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 04:05:02,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 04:05:02,600 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:05:03,021 INFO L93 Difference]: Finished difference Result 321 states and 453 transitions. [2024-11-07 04:05:03,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 04:05:03,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 140 [2024-11-07 04:05:03,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:05:03,024 INFO L225 Difference]: With dead ends: 321 [2024-11-07 04:05:03,024 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 04:05:03,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-07 04:05:03,026 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 94 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 869 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 04:05:03,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 869 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 04:05:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 04:05:03,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 134. [2024-11-07 04:05:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.3203883495145632) internal successors, (136), 105 states have internal predecessors, (136), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 04:05:03,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 190 transitions. [2024-11-07 04:05:03,045 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 190 transitions. Word has length 140 [2024-11-07 04:05:03,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:05:03,045 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 190 transitions. [2024-11-07 04:05:03,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 190 transitions. [2024-11-07 04:05:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 04:05:03,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:03,047 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:03,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 04:05:03,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:03,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:03,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1962011690, now seen corresponding path program 1 times [2024-11-07 04:05:03,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:05:03,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632233451] [2024-11-07 04:05:03,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:03,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:05:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:05:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:05:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:05:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:05:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:05:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:05:03,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:05:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:05:03,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:05:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:05:03,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:05:03,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:05:03,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:05:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:05:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:05:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:05:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:05:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:05:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:05:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:05:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:05:03,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:05:03,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:05:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632233451] [2024-11-07 04:05:03,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632233451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:05:03,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:05:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 04:05:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111347176] [2024-11-07 04:05:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:05:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 04:05:03,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:05:03,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 04:05:03,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 04:05:03,149 INFO L87 Difference]: Start difference. First operand 134 states and 190 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:03,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:05:03,189 INFO L93 Difference]: Finished difference Result 325 states and 462 transitions. [2024-11-07 04:05:03,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 04:05:03,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-07 04:05:03,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:05:03,192 INFO L225 Difference]: With dead ends: 325 [2024-11-07 04:05:03,192 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 04:05:03,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 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 04:05:03,193 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 46 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 04:05:03,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 224 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:05:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 04:05:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 182. [2024-11-07 04:05:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 153 states have internal predecessors, (206), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 04:05:03,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 260 transitions. [2024-11-07 04:05:03,211 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 260 transitions. Word has length 142 [2024-11-07 04:05:03,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:05:03,212 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 260 transitions. [2024-11-07 04:05:03,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:03,212 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 260 transitions. [2024-11-07 04:05:03,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-07 04:05:03,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:03,225 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:03,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 04:05:03,226 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:03,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:03,226 INFO L85 PathProgramCache]: Analyzing trace with hash -2031190326, now seen corresponding path program 1 times [2024-11-07 04:05:03,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:05:03,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930993345] [2024-11-07 04:05:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:05:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:05:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:05:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:05:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:05:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:05:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:05:03,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:05:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:05:03,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:05:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:05:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:05:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:05:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:05:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:05:03,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:05:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:05:03,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:05:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:05:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:05:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:05:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:05:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:03,971 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:05:03,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:05:03,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930993345] [2024-11-07 04:05:03,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930993345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:05:03,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:05:03,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 04:05:03,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876925585] [2024-11-07 04:05:03,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:05:03,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 04:05:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:05:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 04:05:03,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 04:05:03,973 INFO L87 Difference]: Start difference. First operand 182 states and 260 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:04,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:05:04,216 INFO L93 Difference]: Finished difference Result 454 states and 650 transitions. [2024-11-07 04:05:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 04:05:04,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 142 [2024-11-07 04:05:04,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:05:04,220 INFO L225 Difference]: With dead ends: 454 [2024-11-07 04:05:04,220 INFO L226 Difference]: Without dead ends: 279 [2024-11-07 04:05:04,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 04:05:04,221 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 40 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-07 04:05:04,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 355 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-07 04:05:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-07 04:05:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 235. [2024-11-07 04:05:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 204 states have (on average 1.411764705882353) internal successors, (288), 206 states have internal predecessors, (288), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 25 states have call predecessors, (27), 27 states have call successors, (27) [2024-11-07 04:05:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 342 transitions. [2024-11-07 04:05:04,242 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 342 transitions. Word has length 142 [2024-11-07 04:05:04,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:05:04,242 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 342 transitions. [2024-11-07 04:05:04,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 342 transitions. [2024-11-07 04:05:04,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 04:05:04,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:04,244 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:04,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 04:05:04,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:04,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:04,245 INFO L85 PathProgramCache]: Analyzing trace with hash 23903870, now seen corresponding path program 1 times [2024-11-07 04:05:04,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:05:04,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067017032] [2024-11-07 04:05:04,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:04,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:05:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 04:05:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 04:05:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 04:05:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 04:05:04,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 04:05:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 04:05:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 04:05:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 04:05:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 04:05:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 04:05:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-07 04:05:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 04:05:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-07 04:05:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 04:05:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 04:05:04,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-07 04:05:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 04:05:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-07 04:05:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 04:05:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 04:05:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 04:05:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:04,351 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:05:04,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 04:05:04,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067017032] [2024-11-07 04:05:04,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067017032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:05:04,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:05:04,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 04:05:04,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166280326] [2024-11-07 04:05:04,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:05:04,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 04:05:04,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 04:05:04,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 04:05:04,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:05:04,354 INFO L87 Difference]: Start difference. First operand 235 states and 342 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:05:04,460 INFO L93 Difference]: Finished difference Result 569 states and 811 transitions. [2024-11-07 04:05:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 04:05:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 143 [2024-11-07 04:05:04,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:05:04,463 INFO L225 Difference]: With dead ends: 569 [2024-11-07 04:05:04,463 INFO L226 Difference]: Without dead ends: 341 [2024-11-07 04:05:04,464 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-07 04:05:04,467 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 107 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 04:05:04,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 240 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 04:05:04,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2024-11-07 04:05:04,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 289. [2024-11-07 04:05:04,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 255 states have (on average 1.380392156862745) internal successors, (352), 258 states have internal predecessors, (352), 29 states have call successors, (29), 4 states have call predecessors, (29), 4 states have return successors, (29), 26 states have call predecessors, (29), 29 states have call successors, (29) [2024-11-07 04:05:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 410 transitions. [2024-11-07 04:05:04,496 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 410 transitions. Word has length 143 [2024-11-07 04:05:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:05:04,497 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 410 transitions. [2024-11-07 04:05:04,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 410 transitions. [2024-11-07 04:05:04,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-07 04:05:04,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:04,502 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:04,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 04:05:04,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:04,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:04,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1888154417, now seen corresponding path program 1 times [2024-11-07 04:05:04,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 04:05:04,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423262367] [2024-11-07 04:05:04,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:04,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 04:05:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-07 04:05:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013184863] [2024-11-07 04:05:04,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:04,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-07 04:05:04,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:05:04,603 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 04:05:04,604 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 04:05:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:05:04,873 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 04:05:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 04:05:05,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 04:05:05,040 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 04:05:05,041 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 04:05:05,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-07 04:05:05,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-07 04:05:05,247 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 04:05:05,353 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 04:05:05,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:05:05 BoogieIcfgContainer [2024-11-07 04:05:05,355 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 04:05:05,356 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 04:05:05,356 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 04:05:05,356 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 04:05:05,357 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:04:54" (3/4) ... [2024-11-07 04:05:05,359 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 04:05:05,359 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 04:05:05,360 INFO L158 Benchmark]: Toolchain (without parser) took 11882.57ms. Allocated memory was 109.1MB in the beginning and 243.3MB in the end (delta: 134.2MB). Free memory was 85.3MB in the beginning and 125.4MB in the end (delta: -40.1MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2024-11-07 04:05:05,360 INFO L158 Benchmark]: CDTParser took 0.77ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:05:05,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.76ms. Allocated memory is still 109.1MB. Free memory was 85.1MB in the beginning and 71.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 04:05:05,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.26ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 68.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:05:05,361 INFO L158 Benchmark]: Boogie Preprocessor took 49.74ms. Allocated memory is still 109.1MB. Free memory was 68.7MB in the beginning and 65.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:05:05,361 INFO L158 Benchmark]: RCFGBuilder took 613.09ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 44.4MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-07 04:05:05,361 INFO L158 Benchmark]: TraceAbstraction took 10920.01ms. Allocated memory was 109.1MB in the beginning and 243.3MB in the end (delta: 134.2MB). Free memory was 43.7MB in the beginning and 128.1MB in the end (delta: -84.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-07 04:05:05,362 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 243.3MB. Free memory was 128.1MB in the beginning and 125.4MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 04:05:05,363 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.77ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.76ms. Allocated memory is still 109.1MB. Free memory was 85.1MB in the beginning and 71.3MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.26ms. Allocated memory is still 109.1MB. Free memory was 71.3MB in the beginning and 68.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.74ms. Allocated memory is still 109.1MB. Free memory was 68.7MB in the beginning and 65.9MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 613.09ms. Allocated memory is still 109.1MB. Free memory was 65.9MB in the beginning and 44.4MB in the end (delta: 21.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10920.01ms. Allocated memory was 109.1MB in the beginning and 243.3MB in the end (delta: 134.2MB). Free memory was 43.7MB in the beginning and 128.1MB in the end (delta: -84.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 243.3MB. Free memory was 128.1MB in the beginning and 125.4MB in the end (delta: 2.7MB). 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 someBinaryDOUBLEComparisonOperation at line 136, overapproximation of shiftLeft at line 136. Possible FailurePath: [L25] unsigned char isInitial = 0; [L26] double var_1_1 = 5.5; [L27] signed char var_1_2 = 100; [L28] signed short int var_1_3 = 1; [L29] signed long int var_1_4 = -16; [L30] signed long int var_1_5 = -64; [L31] signed char var_1_6 = 10; [L32] signed char var_1_7 = 5; [L33] double var_1_8 = 16.25; [L34] double var_1_9 = 1.8; [L35] unsigned char var_1_10 = 32; [L36] unsigned char var_1_11 = 64; [L37] unsigned short int var_1_12 = 16; [L38] unsigned long int var_1_13 = 128; [L39] unsigned char var_1_15 = 1; [L40] unsigned short int var_1_16 = 256; [L41] unsigned short int var_1_17 = 8; [L42] signed char var_1_18 = -2; VAL [isInitial=0, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=100, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L100] var_1_2 = __VERIFIER_nondet_char() [L101] CALL assume_abort_if_not(var_1_2 >= -128) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L101] RET assume_abort_if_not(var_1_2 >= -128) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L102] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=1, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L103] var_1_3 = __VERIFIER_nondet_short() [L104] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L104] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L105] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=-16, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L106] var_1_4 = __VERIFIER_nondet_long() [L107] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L107] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L108] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L109] var_1_5 = __VERIFIER_nondet_long() [L110] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L110] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L111] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L112] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L113] var_1_6 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L114] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L115] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L116] var_1_7 = __VERIFIER_nondet_char() [L117] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L117] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L118] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L118] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=65/4, var_1_9=9/5] [L119] var_1_8 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_9=9/5] [L120] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_9=9/5] [L121] var_1_9 = __VERIFIER_nondet_double() [L122] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L122] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L123] var_1_11 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L124] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L125] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L125] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L126] var_1_15 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L127] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L128] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L128] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_17=8, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L129] var_1_17 = __VERIFIER_nondet_ushort() [L130] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L130] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L131] CALL assume_abort_if_not(var_1_17 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L131] RET assume_abort_if_not(var_1_17 <= 65535) VAL [isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L144] RET updateVariables() [L145] CALL step() [L72] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=32, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L72] COND FALSE !((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) [L79] COND TRUE var_1_6 <= (var_1_4 + var_1_7) [L80] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=16, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L84] COND TRUE ((var_1_6 >> 2) * var_1_10) > var_1_4 [L85] var_1_12 = var_1_6 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L87] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=128, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L87] COND FALSE !((1 << var_1_2) != (-500 / -100)) [L94] var_1_13 = var_1_6 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6] [L96] CALL functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L53] COND FALSE !((- functionized3_localFunctionVar3) <= functionized3_localFunctionVar1) [L66] var_1_16 = functionized3_localFunctionVar2 VAL [functionized3_localFunctionVar0=18, functionized3_localFunctionVar4=-256, isInitial=1, localFunctionVar5=256, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=-2, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L96] RET functionized3(var_1_17, var_1_8, var_1_10, var_1_9, var_1_15, 256) [L97] var_1_18 = var_1_3 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L145] RET step() [L146] CALL, EXPR property() [L136] EXPR var_1_2 >> var_1_3 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR ((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR 1 << var_1_2 VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L136] EXPR (((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L136-L137] return (((((((var_1_2 >> var_1_3) == (var_1_4 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_4 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (var_1_4 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * var_1_10) > var_1_4) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_2) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_10 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_2) ? ((var_1_17 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=-509, var_1_11=-509, var_1_12=12, var_1_13=12, var_1_15=-256, var_1_16=3, var_1_17=18, var_1_18=0, var_1_1=11/2, var_1_2=1, var_1_3=0, var_1_4=8, var_1_5=3, var_1_6=12, var_1_7=6, var_1_8=3, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 10, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 614 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 4008 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2776 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1132 IncrementalHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 1232 mSDtfsCounter, 1132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 462 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=289occurred in iteration=9, InterpolantAutomatonStates: 41, 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, 9 MinimizatonAttempts, 258 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1551 NumberOfCodeBlocks, 1551 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1256 ConstructedInterpolants, 0 QuantifiedInterpolants, 3841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 7560/7560 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 04:05:05,390 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_codestructure_functionizing_file-9.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 b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 04:05:07,520 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 04:05:07,628 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-07 04:05:07,635 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 04:05:07,635 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 04:05:07,660 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 04:05:07,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 04:05:07,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 04:05:07,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 04:05:07,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 04:05:07,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 04:05:07,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 04:05:07,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 04:05:07,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 04:05:07,663 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 04:05:07,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 04:05:07,664 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 04:05:07,664 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 04:05:07,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 04:05:07,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 04:05:07,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 04:05:07,665 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 04:05:07,666 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 04:05:07,666 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 04:05:07,666 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 04:05:07,666 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 04:05:07,666 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 04:05:07,666 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:05:07,667 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 04:05:07,667 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 04:05:07,667 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 04:05:07,667 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 04:05:07,667 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 04:05:07,667 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 04:05:07,667 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 04:05:07,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 04:05:07,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 04:05:07,668 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 -> b5fd059d5a759507a96afa6a0d4588ef4f04a7933448ee3dd4bfcf9210da23be [2024-11-07 04:05:07,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 04:05:07,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 04:05:07,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 04:05:07,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 04:05:07,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 04:05:07,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-07 04:05:09,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 04:05:09,572 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 04:05:09,573 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_functionizing_file-9.i [2024-11-07 04:05:09,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7268a86d5/cd50c0fd070340b7a933ebd9627ee378/FLAGd988e06fc [2024-11-07 04:05:09,607 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7268a86d5/cd50c0fd070340b7a933ebd9627ee378 [2024-11-07 04:05:09,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 04:05:09,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 04:05:09,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 04:05:09,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 04:05:09,620 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 04:05:09,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:09,621 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dec50be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09, skipping insertion in model container [2024-11-07 04:05:09,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:09,640 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 04:05:09,775 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_codestructure_functionizing_file-9.i[919,932] [2024-11-07 04:05:09,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:05:09,869 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 04:05:09,882 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_codestructure_functionizing_file-9.i[919,932] [2024-11-07 04:05:09,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 04:05:09,926 INFO L204 MainTranslator]: Completed translation [2024-11-07 04:05:09,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09 WrapperNode [2024-11-07 04:05:09,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 04:05:09,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 04:05:09,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 04:05:09,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 04:05:09,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:09,957 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:09,987 INFO L138 Inliner]: procedures = 31, calls = 38, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 155 [2024-11-07 04:05:09,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 04:05:09,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 04:05:09,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 04:05:09,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 04:05:10,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,001 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,009 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,031 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 04:05:10,031 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,031 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,050 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,056 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,058 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 04:05:10,070 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 04:05:10,070 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 04:05:10,070 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 04:05:10,071 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (1/1) ... [2024-11-07 04:05:10,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 04:05:10,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 04:05:10,101 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 04:05:10,104 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 04:05:10,125 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 04:05:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 04:05:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 04:05:10,126 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 04:05:10,126 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 04:05:10,126 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 04:05:10,218 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 04:05:10,220 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 04:05:10,566 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2024-11-07 04:05:10,566 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 04:05:10,575 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 04:05:10,575 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 04:05:10,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:10 BoogieIcfgContainer [2024-11-07 04:05:10,575 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 04:05:10,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 04:05:10,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 04:05:10,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 04:05:10,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:05:09" (1/3) ... [2024-11-07 04:05:10,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795fe882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:10, skipping insertion in model container [2024-11-07 04:05:10,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:05:09" (2/3) ... [2024-11-07 04:05:10,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795fe882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:05:10, skipping insertion in model container [2024-11-07 04:05:10,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:05:10" (3/3) ... [2024-11-07 04:05:10,607 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_functionizing_file-9.i [2024-11-07 04:05:10,618 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 04:05:10,618 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 04:05:10,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 04:05:10,671 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;@7a95d152, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 04:05:10,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 04:05:10,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:05:10,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-07 04:05:10,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:10,687 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:10,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:10,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:10,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1971917253, now seen corresponding path program 1 times [2024-11-07 04:05:10,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:05:10,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207927823] [2024-11-07 04:05:10,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:10,700 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 04:05:10,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:05:10,702 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 04:05:10,703 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 04:05:10,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:10,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-07 04:05:10,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:05:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-07 04:05:10,966 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 04:05:10,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:05:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1207927823] [2024-11-07 04:05:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1207927823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 04:05:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 04:05:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 04:05:10,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271584537] [2024-11-07 04:05:10,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 04:05:10,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 04:05:10,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:05:10,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 04:05:10,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 04:05:10,992 INFO L87 Difference]: Start difference. First operand has 66 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:11,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:05:11,019 INFO L93 Difference]: Finished difference Result 125 states and 213 transitions. [2024-11-07 04:05:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 04:05:11,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 132 [2024-11-07 04:05:11,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:05:11,027 INFO L225 Difference]: With dead ends: 125 [2024-11-07 04:05:11,027 INFO L226 Difference]: Without dead ends: 62 [2024-11-07 04:05:11,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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 04:05:11,031 INFO L432 NwaCegarLoop]: 91 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, 91 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 04:05:11,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 04:05:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-07 04:05:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-07 04:05:11,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:05:11,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2024-11-07 04:05:11,068 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 132 [2024-11-07 04:05:11,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:05:11,070 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2024-11-07 04:05:11,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-07 04:05:11,070 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2024-11-07 04:05:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 04:05:11,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:11,073 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:11,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 (2)] Ended with exit code 0 [2024-11-07 04:05:11,273 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 04:05:11,274 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:11,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:11,275 INFO L85 PathProgramCache]: Analyzing trace with hash -2079072756, now seen corresponding path program 1 times [2024-11-07 04:05:11,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:05:11,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929162309] [2024-11-07 04:05:11,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:11,276 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 04:05:11,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:05:11,281 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 04:05:11,282 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 04:05:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:11,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 04:05:11,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:05:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-07 04:05:12,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:05:12,990 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 04:05:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929162309] [2024-11-07 04:05:12,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929162309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:05:12,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1940354641] [2024-11-07 04:05:12,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:12,991 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-07 04:05:12,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-07 04:05:12,995 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-07 04:05:12,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-07 04:05:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:13,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 04:05:13,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 04:05:14,508 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 440 proven. 129 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-11-07 04:05:14,508 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 04:05:14,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1940354641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-07 04:05:14,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 04:05:14,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-07 04:05:14,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488585091] [2024-11-07 04:05:14,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 04:05:14,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-07 04:05:14,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 04:05:14,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-07 04:05:14,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-07 04:05:14,567 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-07 04:05:15,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 04:05:15,557 INFO L93 Difference]: Finished difference Result 137 states and 192 transitions. [2024-11-07 04:05:15,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 04:05:15,562 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) Word has length 134 [2024-11-07 04:05:15,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 04:05:15,564 INFO L225 Difference]: With dead ends: 137 [2024-11-07 04:05:15,564 INFO L226 Difference]: Without dead ends: 78 [2024-11-07 04:05:15,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2024-11-07 04:05:15,565 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 94 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 04:05:15,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 265 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 04:05:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-07 04:05:15,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-07 04:05:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 04:05:15,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2024-11-07 04:05:15,578 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 134 [2024-11-07 04:05:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 04:05:15,578 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2024-11-07 04:05:15,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 12 states have internal predecessors, (47), 4 states have call successors, (21), 4 states have call predecessors, (21), 6 states have return successors, (21), 4 states have call predecessors, (21), 4 states have call successors, (21) [2024-11-07 04:05:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2024-11-07 04:05:15,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-07 04:05:15,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 04:05:15,580 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:05:15,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-07 04:05:15,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-07 04:05:15,981 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,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-07 04:05:15,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 04:05:15,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 04:05:15,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1406547914, now seen corresponding path program 1 times [2024-11-07 04:05:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 04:05:15,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958504494] [2024-11-07 04:05:15,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 04:05:15,983 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 04:05:15,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 04:05:15,986 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 04:05:15,987 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 04:05:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 04:05:16,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-07 04:05:16,177 INFO L278 TraceCheckSpWp]: Computing forward predicates...