./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.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_dependencies_file-31.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', 'e96e0741077dfa35eaffe50649a9977febecc176f1f00558a8360a84df9b88d1'] 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_dependencies_file-31.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 e96e0741077dfa35eaffe50649a9977febecc176f1f00558a8360a84df9b88d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:55:06,540 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:55:06,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 03:55:06,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:55:06,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:55:06,682 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:55:06,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:55:06,683 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:55:06,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:55:06,686 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:55:06,686 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:55:06,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:55:06,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:55:06,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:55:06,687 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 03:55:06,687 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:55:06,688 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:55:06,688 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:55:06,688 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:55:06,688 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:55:06,688 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:55:06,688 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:55:06,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:55:06,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:55:06,691 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 -> e96e0741077dfa35eaffe50649a9977febecc176f1f00558a8360a84df9b88d1 [2024-11-07 03:55:07,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:55:07,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:55:07,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:55:07,015 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:55:07,015 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:55:07,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i [2024-11-07 03:55:08,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:55:08,626 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:55:08,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-31.i [2024-11-07 03:55:08,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d39e4a86/5c8d4119a1a747a093b028442e5d8d90/FLAG924b61c99 [2024-11-07 03:55:08,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d39e4a86/5c8d4119a1a747a093b028442e5d8d90 [2024-11-07 03:55:08,669 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:55:08,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:55:08,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:55:08,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:55:08,677 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:55:08,678 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:08,679 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51fb884c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08, skipping insertion in model container [2024-11-07 03:55:08,679 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:08,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:55:08,832 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_dependencies_file-31.i[919,932] [2024-11-07 03:55:08,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:55:08,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:55:08,931 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_dependencies_file-31.i[919,932] [2024-11-07 03:55:08,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:55:08,982 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:55:08,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08 WrapperNode [2024-11-07 03:55:08,983 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:55:08,984 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:55:08,984 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:55:08,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:55:08,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:08,997 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,033 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-07 03:55:09,034 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:55:09,034 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:55:09,034 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:55:09,035 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:55:09,041 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,044 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,060 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 03:55:09,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,067 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,070 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,073 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:55:09,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:55:09,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:55:09,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:55:09,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (1/1) ... [2024-11-07 03:55:09,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:55:09,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:55:09,121 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 03:55:09,124 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 03:55:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:55:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-07 03:55:09,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-07 03:55:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:55:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:55:09,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:55:09,235 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:55:09,237 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:55:09,563 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-07 03:55:09,563 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:55:09,576 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:55:09,577 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:55:09,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:09 BoogieIcfgContainer [2024-11-07 03:55:09,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:55:09,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:55:09,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:55:09,586 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:55:09,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:55:08" (1/3) ... [2024-11-07 03:55:09,587 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d56262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:09, skipping insertion in model container [2024-11-07 03:55:09,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:55:08" (2/3) ... [2024-11-07 03:55:09,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d56262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:55:09, skipping insertion in model container [2024-11-07 03:55:09,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:55:09" (3/3) ... [2024-11-07 03:55:09,589 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-31.i [2024-11-07 03:55:09,614 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:55:09,615 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:55:09,679 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:55:09,692 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;@708879bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:55:09,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:55:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:55:09,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 03:55:09,710 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:09,711 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:09,711 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:09,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:09,716 INFO L85 PathProgramCache]: Analyzing trace with hash -831968484, now seen corresponding path program 1 times [2024-11-07 03:55:09,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:09,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501108549] [2024-11-07 03:55:09,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:09,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:55:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:10,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:55:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:10,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:55:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:55:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:10,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:55:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:55:10,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:55:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:55:10,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:55:10,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:55:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:55:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:55:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 03:55:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 03:55:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 03:55:10,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 03:55:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 03:55:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 03:55:10,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:10,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501108549] [2024-11-07 03:55:10,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501108549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:10,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:10,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-07 03:55:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787824247] [2024-11-07 03:55:10,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:10,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-07 03:55:10,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:10,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-07 03:55:10,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-07 03:55:10,230 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.368421052631579) internal successors, (52), 39 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 03:55:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:10,259 INFO L93 Difference]: Finished difference Result 123 states and 218 transitions. [2024-11-07 03:55:10,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-07 03:55:10,261 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), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 147 [2024-11-07 03:55:10,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:10,270 INFO L225 Difference]: With dead ends: 123 [2024-11-07 03:55:10,270 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 03:55:10,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 03:55:10,280 INFO L432 NwaCegarLoop]: 93 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, 93 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 03:55:10,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:55:10,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 03:55:10,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-07 03:55:10,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 35 states have (on average 1.2857142857142858) internal successors, (45), 35 states have internal predecessors, (45), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-07 03:55:10,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 93 transitions. [2024-11-07 03:55:10,327 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 93 transitions. Word has length 147 [2024-11-07 03:55:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:10,328 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 93 transitions. [2024-11-07 03:55:10,328 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), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-07 03:55:10,328 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 93 transitions. [2024-11-07 03:55:10,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 03:55:10,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:10,331 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:10,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:55:10,331 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:10,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:10,332 INFO L85 PathProgramCache]: Analyzing trace with hash -2027103460, now seen corresponding path program 1 times [2024-11-07 03:55:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10334864] [2024-11-07 03:55:10,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:55:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:55:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:55:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:55:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:55:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:55:16,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:55:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:55:16,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:55:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:55:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:55:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:55:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 03:55:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 03:55:16,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 03:55:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 03:55:16,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 03:55:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 03:55:16,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:16,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10334864] [2024-11-07 03:55:16,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10334864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:16,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:16,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-07 03:55:16,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013004238] [2024-11-07 03:55:16,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:16,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-07 03:55:16,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:16,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-07 03:55:16,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 03:55:16,719 INFO L87 Difference]: Start difference. First operand 61 states and 93 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 03:55:18,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:18,612 INFO L93 Difference]: Finished difference Result 199 states and 286 transitions. [2024-11-07 03:55:18,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-07 03:55:18,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2024-11-07 03:55:18,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:18,616 INFO L225 Difference]: With dead ends: 199 [2024-11-07 03:55:18,616 INFO L226 Difference]: Without dead ends: 141 [2024-11-07 03:55:18,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-11-07 03:55:18,618 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 127 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:18,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 614 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 03:55:18,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-07 03:55:18,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 100. [2024-11-07 03:55:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 66 states have (on average 1.303030303030303) internal successors, (86), 68 states have internal predecessors, (86), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-07 03:55:18,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 146 transitions. [2024-11-07 03:55:18,649 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 146 transitions. Word has length 147 [2024-11-07 03:55:18,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:18,649 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 146 transitions. [2024-11-07 03:55:18,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 03:55:18,650 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 146 transitions. [2024-11-07 03:55:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-07 03:55:18,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:18,652 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:18,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:55:18,652 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:18,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:18,653 INFO L85 PathProgramCache]: Analyzing trace with hash 492856474, now seen corresponding path program 1 times [2024-11-07 03:55:18,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:18,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056744751] [2024-11-07 03:55:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:18,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:18,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-07 03:55:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 03:55:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-07 03:55:18,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 03:55:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-07 03:55:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-07 03:55:18,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-07 03:55:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-07 03:55:18,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 03:55:18,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-07 03:55:18,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-07 03:55:18,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-07 03:55:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-07 03:55:18,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-07 03:55:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-07 03:55:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 03:55:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-07 03:55:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-07 03:55:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-07 03:55:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 03:55:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-07 03:55:18,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-07 03:55:18,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-07 03:55:18,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 03:55:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:55:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-07 03:55:18,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:55:18,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056744751] [2024-11-07 03:55:18,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056744751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:55:18,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:55:18,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-07 03:55:18,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801185257] [2024-11-07 03:55:18,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:55:18,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-07 03:55:18,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:55:18,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-07 03:55:18,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-07 03:55:18,789 INFO L87 Difference]: Start difference. First operand 100 states and 146 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 03:55:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:55:18,852 INFO L93 Difference]: Finished difference Result 268 states and 392 transitions. [2024-11-07 03:55:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-07 03:55:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2024-11-07 03:55:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:55:18,859 INFO L225 Difference]: With dead ends: 268 [2024-11-07 03:55:18,860 INFO L226 Difference]: Without dead ends: 178 [2024-11-07 03:55:18,861 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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 03:55:18,862 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:55:18,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 252 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:55:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-07 03:55:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2024-11-07 03:55:18,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 104 states have (on average 1.2307692307692308) internal successors, (128), 108 states have internal predecessors, (128), 56 states have call successors, (56), 6 states have call predecessors, (56), 6 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-07 03:55:18,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 240 transitions. [2024-11-07 03:55:18,913 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 240 transitions. Word has length 147 [2024-11-07 03:55:18,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:55:18,915 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 240 transitions. [2024-11-07 03:55:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-07 03:55:18,915 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 240 transitions. [2024-11-07 03:55:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-07 03:55:18,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:55:18,920 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:55:18,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:55:18,921 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:55:18,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:55:18,921 INFO L85 PathProgramCache]: Analyzing trace with hash 300425868, now seen corresponding path program 1 times [2024-11-07 03:55:18,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:55:18,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350307960] [2024-11-07 03:55:18,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:55:18,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:55:18,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat