./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-28.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', '0f39224035a48d7ce9f482be8546347834a5df70ab5c0e607d2efca2756bbcbb'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-28.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 0f39224035a48d7ce9f482be8546347834a5df70ab5c0e607d2efca2756bbcbb --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 05:33:16,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 05:33:16,259 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 05:33:16,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 05:33:16,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 05:33:16,296 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 05:33:16,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 05:33:16,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 05:33:16,299 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 05:33:16,299 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 05:33:16,299 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 05:33:16,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 05:33:16,300 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 05:33:16,300 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 05:33:16,300 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 05:33:16,300 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 05:33:16,300 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 05:33:16,300 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 05:33:16,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 05:33:16,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 05:33:16,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 05:33:16,301 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 05:33:16,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:33:16,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 05:33:16,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 05:33:16,302 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 -> 0f39224035a48d7ce9f482be8546347834a5df70ab5c0e607d2efca2756bbcbb [2024-11-07 05:33:16,614 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 05:33:16,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 05:33:16,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 05:33:16,629 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 05:33:16,630 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 05:33:16,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-28.i [2024-11-07 05:33:17,970 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 05:33:18,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 05:33:18,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-28.i [2024-11-07 05:33:18,265 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d875cabff/2a1c7c0f6b2e42c99cf8dc60f20591b5/FLAG0419810ef [2024-11-07 05:33:18,284 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d875cabff/2a1c7c0f6b2e42c99cf8dc60f20591b5 [2024-11-07 05:33:18,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 05:33:18,288 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 05:33:18,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 05:33:18,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 05:33:18,294 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 05:33:18,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f58d340 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18, skipping insertion in model container [2024-11-07 05:33:18,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 05:33:18,463 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-28.i[915,928] [2024-11-07 05:33:18,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:33:18,572 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 05:33:18,587 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-50_file-28.i[915,928] [2024-11-07 05:33:18,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 05:33:18,659 INFO L204 MainTranslator]: Completed translation [2024-11-07 05:33:18,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18 WrapperNode [2024-11-07 05:33:18,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 05:33:18,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 05:33:18,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 05:33:18,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 05:33:18,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,688 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,753 INFO L138 Inliner]: procedures = 26, calls = 48, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 262 [2024-11-07 05:33:18,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 05:33:18,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 05:33:18,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 05:33:18,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 05:33:18,764 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,810 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-07 05:33:18,813 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,813 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 05:33:18,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 05:33:18,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 05:33:18,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 05:33:18,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (1/1) ... [2024-11-07 05:33:18,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 05:33:18,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 05:33:18,889 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-07 05:33:18,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-07 05:33:18,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 05:33:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 05:33:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 05:33:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 05:33:18,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 05:33:18,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 05:33:19,016 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 05:33:19,018 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 05:33:19,477 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-07 05:33:19,477 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 05:33:19,490 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 05:33:19,492 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 05:33:19,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:33:19 BoogieIcfgContainer [2024-11-07 05:33:19,493 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 05:33:19,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 05:33:19,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 05:33:19,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 05:33:19,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:33:18" (1/3) ... [2024-11-07 05:33:19,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30544419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:33:19, skipping insertion in model container [2024-11-07 05:33:19,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:33:18" (2/3) ... [2024-11-07 05:33:19,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30544419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:33:19, skipping insertion in model container [2024-11-07 05:33:19,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:33:19" (3/3) ... [2024-11-07 05:33:19,503 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-50_file-28.i [2024-11-07 05:33:19,518 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 05:33:19,519 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 05:33:19,580 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 05:33:19,591 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;@a826a02, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 05:33:19,592 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 05:33:19,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 05:33:19,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-07 05:33:19,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:33:19,616 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:33:19,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:33:19,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:33:19,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1233466681, now seen corresponding path program 1 times [2024-11-07 05:33:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:33:19,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686181533] [2024-11-07 05:33:19,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:33:19,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:33:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:19,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:33:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:33:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:33:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:33:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:33:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:33:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:33:20,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:33:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:33:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:33:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:33:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:33:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:33:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:33:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:33:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:33:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:33:20,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:33:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:33:20,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:33:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:33:20,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:33:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:33:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:33:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:33:20,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:33:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:33:20,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:33:20,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:33:20,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:33:20,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:33:20,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:33:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 05:33:20,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:33:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 05:33:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:20,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-07 05:33:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:33:20,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686181533] [2024-11-07 05:33:20,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686181533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:33:20,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:33:20,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 05:33:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139296018] [2024-11-07 05:33:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:33:20,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 05:33:20,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:33:20,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 05:33:20,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:33:20,308 INFO L87 Difference]: Start difference. First operand has 113 states, 75 states have (on average 1.4266666666666667) internal successors, (107), 76 states have internal predecessors, (107), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 05:33:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:33:20,349 INFO L93 Difference]: Finished difference Result 219 states and 383 transitions. [2024-11-07 05:33:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 05:33:20,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) Word has length 226 [2024-11-07 05:33:20,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:33:20,358 INFO L225 Difference]: With dead ends: 219 [2024-11-07 05:33:20,359 INFO L226 Difference]: Without dead ends: 109 [2024-11-07 05:33:20,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 05:33:20,367 INFO L432 NwaCegarLoop]: 170 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, 170 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 05:33:20,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 05:33:20,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-07 05:33:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-07 05:33:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 72 states have (on average 1.3888888888888888) internal successors, (100), 72 states have internal predecessors, (100), 35 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 05:33:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 170 transitions. [2024-11-07 05:33:20,419 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 170 transitions. Word has length 226 [2024-11-07 05:33:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:33:20,419 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 170 transitions. [2024-11-07 05:33:20,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 2 states have call successors, (35) [2024-11-07 05:33:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 170 transitions. [2024-11-07 05:33:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-07 05:33:20,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:33:20,426 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:33:20,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 05:33:20,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:33:20,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:33:20,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1424483725, now seen corresponding path program 1 times [2024-11-07 05:33:20,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:33:20,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81628708] [2024-11-07 05:33:20,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:33:20,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:33:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 05:33:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 05:33:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 05:33:21,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 05:33:21,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 05:33:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 05:33:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 05:33:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 05:33:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 05:33:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 05:33:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 05:33:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 05:33:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 05:33:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 05:33:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 05:33:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 05:33:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 05:33:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 05:33:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 05:33:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-07 05:33:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-07 05:33:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-07 05:33:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-07 05:33:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-07 05:33:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-07 05:33:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-07 05:33:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-07 05:33:21,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-07 05:33:21,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-07 05:33:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-07 05:33:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-07 05:33:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-07 05:33:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-07 05:33:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-07 05:33:21,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-07 05:33:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 05:33:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2380 trivial. 0 not checked. [2024-11-07 05:33:21,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 05:33:21,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81628708] [2024-11-07 05:33:21,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81628708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 05:33:21,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 05:33:21,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 05:33:21,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535511877] [2024-11-07 05:33:21,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 05:33:21,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 05:33:21,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 05:33:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 05:33:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 05:33:21,296 INFO L87 Difference]: Start difference. First operand 109 states and 170 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-07 05:33:21,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 05:33:21,680 INFO L93 Difference]: Finished difference Result 304 states and 472 transitions. [2024-11-07 05:33:21,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 05:33:21,681 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 226 [2024-11-07 05:33:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 05:33:21,684 INFO L225 Difference]: With dead ends: 304 [2024-11-07 05:33:21,684 INFO L226 Difference]: Without dead ends: 198 [2024-11-07 05:33:21,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 05:33:21,686 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 290 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-07 05:33:21,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 349 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-07 05:33:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-07 05:33:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 114. [2024-11-07 05:33:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 76 states have (on average 1.368421052631579) internal successors, (104), 76 states have internal predecessors, (104), 35 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-07 05:33:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 174 transitions. [2024-11-07 05:33:21,723 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 174 transitions. Word has length 226 [2024-11-07 05:33:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 05:33:21,725 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 174 transitions. [2024-11-07 05:33:21,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (35), 1 states have call predecessors, (35), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2024-11-07 05:33:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 174 transitions. [2024-11-07 05:33:21,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-07 05:33:21,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 05:33:21,732 INFO L215 NwaCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 05:33:21,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 05:33:21,732 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 05:33:21,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 05:33:21,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1283935115, now seen corresponding path program 1 times [2024-11-07 05:33:21,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 05:33:21,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3905233] [2024-11-07 05:33:21,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 05:33:21,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 05:33:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat