./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
Using default analysis
Version 84cfde4a
Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-84cfde4
[2024-10-11 12:17:12,738 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-10-11 12:17:12,802 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-10-11 12:17:12,808 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-10-11 12:17:12,811 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-10-11 12:17:12,840 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-10-11 12:17:12,841 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-10-11 12:17:12,842 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-10-11 12:17:12,843 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-10-11 12:17:12,844 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2024-10-11 12:17:12,845 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-10-11 12:17:12,845 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-10-11 12:17:12,846 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-10-11 12:17:12,846 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-10-11 12:17:12,847 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-10-11 12:17:12,847 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-10-11 12:17:12,848 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-10-11 12:17:12,848 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-10-11 12:17:12,848 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-10-11 12:17:12,849 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-10-11 12:17:12,849 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-10-11 12:17:12,850 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-10-11 12:17:12,850 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-10-11 12:17:12,850 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-10-11 12:17:12,850 INFO  L153        SettingsManager]:  * Allow undefined functions=false
[2024-10-11 12:17:12,851 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-10-11 12:17:12,851 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-10-11 12:17:12,851 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-10-11 12:17:12,851 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-10-11 12:17:12,852 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-10-11 12:17:12,852 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2024-10-11 12:17:12,852 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-10-11 12:17:12,853 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-11 12:17:12,853 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-10-11 12:17:12,853 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-10-11 12:17:12,854 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-10-11 12:17:12,854 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-10-11 12:17:12,854 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-10-11 12:17:12,855 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-10-11 12:17:12,855 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-10-11 12:17:12,855 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-10-11 12:17:12,856 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-10-11 12:17:12,856 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
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-clean/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 -> f78f07977a6a6c060ce47508f319b35375a64382f2792ef417cdb466597e7230
[2024-10-11 12:17:13,168 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-10-11 12:17:13,199 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-10-11 12:17:13,202 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-10-11 12:17:13,205 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-10-11 12:17:13,205 INFO  L274        PluginConnector]: CDTParser initialized
[2024-10-11 12:17:13,207 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i
[2024-10-11 12:17:14,693 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-10-11 12:17:15,005 INFO  L384              CDTParser]: Found 1 translation units.
[2024-10-11 12:17:15,007 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i
[2024-10-11 12:17:15,027 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5333acbb3/974366fc49384e7e8c94c47676f608ae/FLAGec2fe5273
[2024-10-11 12:17:15,287 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5333acbb3/974366fc49384e7e8c94c47676f608ae
[2024-10-11 12:17:15,290 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-10-11 12:17:15,292 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-10-11 12:17:15,293 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-10-11 12:17:15,294 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-10-11 12:17:15,300 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-10-11 12:17:15,301 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,302 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a62936 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15, skipping insertion in model container
[2024-10-11 12:17:15,303 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,343 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2024-10-11 12:17:15,519 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929]
[2024-10-11 12:17:15,617 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-11 12:17:15,631 INFO  L200         MainTranslator]: Completed pre-run
[2024-10-11 12:17:15,643 WARN  L248   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-97.i[916,929]
[2024-10-11 12:17:15,683 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-10-11 12:17:15,709 INFO  L204         MainTranslator]: Completed translation
[2024-10-11 12:17:15,710 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15 WrapperNode
[2024-10-11 12:17:15,710 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-10-11 12:17:15,712 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-10-11 12:17:15,712 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-10-11 12:17:15,712 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-10-11 12:17:15,720 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,732 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,780 INFO  L138                Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184
[2024-10-11 12:17:15,780 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-10-11 12:17:15,781 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-10-11 12:17:15,781 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-10-11 12:17:15,781 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-10-11 12:17:15,792 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,792 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,797 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,840 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-10-11 12:17:15,844 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,845 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,868 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,877 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,885 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,888 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,895 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-10-11 12:17:15,896 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-10-11 12:17:15,896 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-10-11 12:17:15,896 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-10-11 12:17:15,897 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (1/1) ...
[2024-10-11 12:17:15,907 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-10-11 12:17:15,923 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-11 12:17:15,946 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-10-11 12:17:15,950 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-10-11 12:17:16,006 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-10-11 12:17:16,007 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-10-11 12:17:16,008 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-10-11 12:17:16,008 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-10-11 12:17:16,009 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-10-11 12:17:16,009 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-10-11 12:17:16,117 INFO  L238             CfgBuilder]: Building ICFG
[2024-10-11 12:17:16,122 INFO  L264             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-10-11 12:17:16,574 INFO  L?                        ?]: Removed 22 outVars from TransFormulas that were not future-live.
[2024-10-11 12:17:16,575 INFO  L287             CfgBuilder]: Performing block encoding
[2024-10-11 12:17:16,644 INFO  L309             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-10-11 12:17:16,645 INFO  L314             CfgBuilder]: Removed 1 assume(true) statements.
[2024-10-11 12:17:16,645 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:17:16 BoogieIcfgContainer
[2024-10-11 12:17:16,645 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-10-11 12:17:16,649 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-10-11 12:17:16,650 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-10-11 12:17:16,653 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-10-11 12:17:16,654 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:17:15" (1/3) ...
[2024-10-11 12:17:16,656 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2522e6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:17:16, skipping insertion in model container
[2024-10-11 12:17:16,657 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:17:15" (2/3) ...
[2024-10-11 12:17:16,657 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2522e6c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:17:16, skipping insertion in model container
[2024-10-11 12:17:16,657 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:17:16" (3/3) ...
[2024-10-11 12:17:16,659 INFO  L112   eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-97.i
[2024-10-11 12:17:16,677 INFO  L209   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-10-11 12:17:16,678 INFO  L149   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-10-11 12:17:16,767 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-10-11 12:17:16,779 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;@a5b0a1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-10-11 12:17:16,779 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-10-11 12:17:16,784 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 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-10-11 12:17:16,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-11 12:17:16,803 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 12:17:16,804 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, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 12:17:16,806 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 12:17:16,811 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 12:17:16,813 INFO  L85        PathProgramCache]: Analyzing trace with hash 1821303811, now seen corresponding path program 1 times
[2024-10-11 12:17:16,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 12:17:16,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588614310]
[2024-10-11 12:17:16,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:17:16,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 12:17:16,984 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,222 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-11 12:17:17,225 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,231 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-11 12:17:17,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,244 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-11 12:17:17,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,255 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-11 12:17:17,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,268 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-11 12:17:17,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,275 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-11 12:17:17,282 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,289 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-11 12:17:17,292 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,295 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-11 12:17:17,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,301 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-11 12:17:17,303 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,308 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-11 12:17:17,310 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,313 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-11 12:17:17,315 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,321 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-11 12:17:17,324 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,331 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-11 12:17:17,334 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,337 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-11 12:17:17,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,343 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-11 12:17:17,345 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,352 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-11 12:17:17,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,363 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-11 12:17:17,365 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,371 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-11 12:17:17,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,382 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-11 12:17:17,386 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,391 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-11 12:17:17,395 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,401 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-11 12:17:17,407 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,412 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-11 12:17:17,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,422 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-11 12:17:17,425 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,429 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-11 12:17:17,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-10-11 12:17:17,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 12:17:17,444 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588614310]
[2024-10-11 12:17:17,444 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588614310] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 12:17:17,445 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 12:17:17,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-10-11 12:17:17,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503556020]
[2024-10-11 12:17:17,449 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 12:17:17,454 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-10-11 12:17:17,455 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 12:17:17,480 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-10-11 12:17:17,481 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-10-11 12:17:17,483 INFO  L87              Difference]: Start difference. First operand  has 75 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 49 states have internal predecessors, (73), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-10-11 12:17:17,538 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 12:17:17,538 INFO  L93              Difference]: Finished difference Result 147 states and 264 transitions.
[2024-10-11 12:17:17,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-10-11 12:17:17,545 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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 155
[2024-10-11 12:17:17,545 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 12:17:17,556 INFO  L225             Difference]: With dead ends: 147
[2024-10-11 12:17:17,557 INFO  L226             Difference]: Without dead ends: 73
[2024-10-11 12:17:17,563 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-10-11 12:17:17,569 INFO  L432           NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-10-11 12:17:17,571 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-10-11 12:17:17,592 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 73 states.
[2024-10-11 12:17:17,618 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73.
[2024-10-11 12:17:17,620 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 73 states, 47 states have (on average 1.446808510638298) internal successors, (68), 47 states have internal predecessors, (68), 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-10-11 12:17:17,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 116 transitions.
[2024-10-11 12:17:17,626 INFO  L78                 Accepts]: Start accepts. Automaton has 73 states and 116 transitions. Word has length 155
[2024-10-11 12:17:17,627 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 12:17:17,628 INFO  L471      AbstractCegarLoop]: Abstraction has 73 states and 116 transitions.
[2024-10-11 12:17:17,629 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 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-10-11 12:17:17,629 INFO  L276                IsEmpty]: Start isEmpty. Operand 73 states and 116 transitions.
[2024-10-11 12:17:17,632 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-11 12:17:17,635 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 12:17:17,636 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, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 12:17:17,636 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-10-11 12:17:17,637 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 12:17:17,637 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 12:17:17,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -1769755653, now seen corresponding path program 1 times
[2024-10-11 12:17:17,638 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 12:17:17,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614799756]
[2024-10-11 12:17:17,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:17:17,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 12:17:17,733 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,918 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-11 12:17:17,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,926 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-11 12:17:17,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,931 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-11 12:17:17,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,935 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-11 12:17:17,939 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,942 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-11 12:17:17,947 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,950 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-11 12:17:17,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,958 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-11 12:17:17,963 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,966 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-11 12:17:17,969 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,972 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-11 12:17:17,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,978 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-11 12:17:17,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,982 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-11 12:17:17,986 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:17,988 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-11 12:17:17,994 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,000 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-11 12:17:18,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,005 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-11 12:17:18,006 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,011 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-11 12:17:18,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,016 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-11 12:17:18,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,021 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-11 12:17:18,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,025 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-11 12:17:18,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,030 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-11 12:17:18,031 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,033 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-11 12:17:18,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,038 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-11 12:17:18,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,045 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-11 12:17:18,046 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,048 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-11 12:17:18,052 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,056 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-11 12:17:18,058 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:18,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked.
[2024-10-11 12:17:18,065 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 12:17:18,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614799756]
[2024-10-11 12:17:18,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614799756] provided 1 perfect and 0 imperfect interpolant sequences
[2024-10-11 12:17:18,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-10-11 12:17:18,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-10-11 12:17:18,067 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390886012]
[2024-10-11 12:17:18,067 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-10-11 12:17:18,070 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-10-11 12:17:18,070 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 12:17:18,071 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-10-11 12:17:18,072 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-10-11 12:17:18,073 INFO  L87              Difference]: Start difference. First operand 73 states and 116 transitions. Second operand  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-11 12:17:18,174 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 12:17:18,175 INFO  L93              Difference]: Finished difference Result 208 states and 330 transitions.
[2024-10-11 12:17:18,175 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-10-11 12:17:18,176 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 155
[2024-10-11 12:17:18,177 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 12:17:18,179 INFO  L225             Difference]: With dead ends: 208
[2024-10-11 12:17:18,179 INFO  L226             Difference]: Without dead ends: 136
[2024-10-11 12:17:18,181 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-10-11 12:17:18,182 INFO  L432           NwaCegarLoop]: 189 mSDtfsCounter, 94 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-10-11 12:17:18,182 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 289 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-10-11 12:17:18,183 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 136 states.
[2024-10-11 12:17:18,201 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 83.
[2024-10-11 12:17:18,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 57 states have internal predecessors, (84), 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-10-11 12:17:18,203 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 132 transitions.
[2024-10-11 12:17:18,204 INFO  L78                 Accepts]: Start accepts. Automaton has 83 states and 132 transitions. Word has length 155
[2024-10-11 12:17:18,206 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 12:17:18,206 INFO  L471      AbstractCegarLoop]: Abstraction has 83 states and 132 transitions.
[2024-10-11 12:17:18,206 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-11 12:17:18,207 INFO  L276                IsEmpty]: Start isEmpty. Operand 83 states and 132 transitions.
[2024-10-11 12:17:18,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2024-10-11 12:17:18,228 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 12:17:18,228 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, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 12:17:18,229 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-10-11 12:17:18,229 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 12:17:18,229 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 12:17:18,230 INFO  L85        PathProgramCache]: Analyzing trace with hash -1761712083, now seen corresponding path program 1 times
[2024-10-11 12:17:18,230 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 12:17:18,230 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352701965]
[2024-10-11 12:17:18,230 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:17:18,230 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 12:17:18,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-10-11 12:17:18,613 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1692763442]
[2024-10-11 12:17:18,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:17:18,618 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-11 12:17:18,618 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-11 12:17:18,620 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-11 12:17:18,624 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-10-11 12:17:19,253 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:17:19,258 INFO  L255         TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 15 conjuncts are in the unsatisfiable core
[2024-10-11 12:17:19,272 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-11 12:17:20,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 528 proven. 105 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked.
[2024-10-11 12:17:20,291 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-11 12:17:24,540 WARN  L851   $PredicateComparison]: unable to prove that (forall ((v_z_6 Int)) (or (< v_z_6 (mod |c_ULTIMATE.start_step_~stepLocal_6~0#1| 256)) (< 65535 v_z_6) (< (mod (div v_z_6 (mod c_~var_1_7~0 4294967296)) 4294967296) v_z_6))) is different from false
[2024-10-11 12:17:50,634 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 12:17:50,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352701965]
[2024-10-11 12:17:50,635 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2024-10-11 12:17:50,635 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692763442]
[2024-10-11 12:17:50,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692763442] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-11 12:17:50,636 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2024-10-11 12:17:50,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11
[2024-10-11 12:17:50,636 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066192071]
[2024-10-11 12:17:50,636 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2024-10-11 12:17:50,637 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-11 12:17:50,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 12:17:50,639 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-11 12:17:50,639 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=119, Unknown=7, NotChecked=22, Total=182
[2024-10-11 12:17:50,640 INFO  L87              Difference]: Start difference. First operand 83 states and 132 transitions. Second operand  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)
[2024-10-11 12:18:23,081 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 12:18:23,082 INFO  L93              Difference]: Finished difference Result 314 states and 470 transitions.
[2024-10-11 12:18:23,083 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-10-11 12:18:23,083 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 155
[2024-10-11 12:18:23,084 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 12:18:23,087 INFO  L225             Difference]: With dead ends: 314
[2024-10-11 12:18:23,087 INFO  L226             Difference]: Without dead ends: 232
[2024-10-11 12:18:23,089 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 57.8s TimeCoverageRelationStatistics Valid=310, Invalid=1013, Unknown=13, NotChecked=70, Total=1406
[2024-10-11 12:18:23,090 INFO  L432           NwaCegarLoop]: 73 mSDtfsCounter, 273 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time
[2024-10-11 12:18:23,090 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 322 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time]
[2024-10-11 12:18:23,091 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 232 states.
[2024-10-11 12:18:23,115 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 137.
[2024-10-11 12:18:23,116 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 137 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 107 states have internal predecessors, (155), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26)
[2024-10-11 12:18:23,117 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 207 transitions.
[2024-10-11 12:18:23,118 INFO  L78                 Accepts]: Start accepts. Automaton has 137 states and 207 transitions. Word has length 155
[2024-10-11 12:18:23,119 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 12:18:23,119 INFO  L471      AbstractCegarLoop]: Abstraction has 137 states and 207 transitions.
[2024-10-11 12:18:23,119 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 4.545454545454546) internal successors, (50), 11 states have internal predecessors, (50), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24)
[2024-10-11 12:18:23,119 INFO  L276                IsEmpty]: Start isEmpty. Operand 137 states and 207 transitions.
[2024-10-11 12:18:23,122 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-10-11 12:18:23,122 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 12:18:23,122 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 12:18:23,143 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-10-11 12:18:23,326 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-11 12:18:23,328 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 12:18:23,328 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 12:18:23,328 INFO  L85        PathProgramCache]: Analyzing trace with hash -2094702573, now seen corresponding path program 1 times
[2024-10-11 12:18:23,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 12:18:23,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297875606]
[2024-10-11 12:18:23,329 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:18:23,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 12:18:23,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,206 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2
[2024-10-11 12:18:24,207 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,208 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7
[2024-10-11 12:18:24,212 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,214 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13
[2024-10-11 12:18:24,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,217 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18
[2024-10-11 12:18:24,218 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,219 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24
[2024-10-11 12:18:24,219 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,221 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29
[2024-10-11 12:18:24,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,223 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35
[2024-10-11 12:18:24,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,225 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40
[2024-10-11 12:18:24,226 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,227 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-10-11 12:18:24,228 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,229 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-10-11 12:18:24,230 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,232 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57
[2024-10-11 12:18:24,233 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,234 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62
[2024-10-11 12:18:24,235 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,237 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-10-11 12:18:24,237 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,239 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73
[2024-10-11 12:18:24,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,241 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79
[2024-10-11 12:18:24,242 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,243 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85
[2024-10-11 12:18:24,245 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,247 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91
[2024-10-11 12:18:24,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,251 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97
[2024-10-11 12:18:24,252 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,254 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103
[2024-10-11 12:18:24,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,256 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108
[2024-10-11 12:18:24,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,491 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114
[2024-10-11 12:18:24,493 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,496 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119
[2024-10-11 12:18:24,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,502 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125
[2024-10-11 12:18:24,505 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,507 INFO  L368   atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130
[2024-10-11 12:18:24,509 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-10-11 12:18:24,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-10-11 12:18:24,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297875606]
[2024-10-11 12:18:24,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297875606] provided 0 perfect and 1 imperfect interpolant sequences
[2024-10-11 12:18:24,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301251884]
[2024-10-11 12:18:24,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:18:24,520 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-11 12:18:24,520 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-11 12:18:24,524 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-11 12:18:24,526 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-10-11 12:18:24,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:24,669 INFO  L255         TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 10 conjuncts are in the unsatisfiable core
[2024-10-11 12:18:24,677 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-11 12:18:25,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked.
[2024-10-11 12:18:25,609 INFO  L311         TraceCheckSpWp]: Computing backward predicates...
[2024-10-11 12:18:27,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked.
[2024-10-11 12:18:27,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [301251884] provided 0 perfect and 2 imperfect interpolant sequences
[2024-10-11 12:18:27,224 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-10-11 12:18:27,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-10-11 12:18:27,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291965397]
[2024-10-11 12:18:27,225 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-10-11 12:18:27,226 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-10-11 12:18:27,226 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-10-11 12:18:27,227 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-10-11 12:18:27,227 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-10-11 12:18:27,228 INFO  L87              Difference]: Start difference. First operand 137 states and 207 transitions. Second operand  has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)
[2024-10-11 12:18:32,364 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-10-11 12:18:32,365 INFO  L93              Difference]: Finished difference Result 431 states and 622 transitions.
[2024-10-11 12:18:32,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-10-11 12:18:32,365 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 156
[2024-10-11 12:18:32,366 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2024-10-11 12:18:32,370 INFO  L225             Difference]: With dead ends: 431
[2024-10-11 12:18:32,370 INFO  L226             Difference]: Without dead ends: 295
[2024-10-11 12:18:32,372 INFO  L431           NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 355 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=197, Invalid=559, Unknown=0, NotChecked=0, Total=756
[2024-10-11 12:18:32,373 INFO  L432           NwaCegarLoop]: 110 mSDtfsCounter, 208 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time
[2024-10-11 12:18:32,373 INFO  L433           NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 446 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time]
[2024-10-11 12:18:32,374 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 295 states.
[2024-10-11 12:18:32,406 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 209.
[2024-10-11 12:18:32,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 209 states, 153 states have (on average 1.3660130718954249) internal successors, (209), 156 states have internal predecessors, (209), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46)
[2024-10-11 12:18:32,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 301 transitions.
[2024-10-11 12:18:32,411 INFO  L78                 Accepts]: Start accepts. Automaton has 209 states and 301 transitions. Word has length 156
[2024-10-11 12:18:32,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2024-10-11 12:18:32,412 INFO  L471      AbstractCegarLoop]: Abstraction has 209 states and 301 transitions.
[2024-10-11 12:18:32,412 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 2 states have call successors, (28), 2 states have call predecessors, (28), 4 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29)
[2024-10-11 12:18:32,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 209 states and 301 transitions.
[2024-10-11 12:18:32,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 157
[2024-10-11 12:18:32,414 INFO  L207           NwaCegarLoop]: Found error trace
[2024-10-11 12:18:32,415 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-10-11 12:18:32,444 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-10-11 12:18:32,623 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-11 12:18:32,624 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-10-11 12:18:32,624 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2024-10-11 12:18:32,625 INFO  L85        PathProgramCache]: Analyzing trace with hash -2086659003, now seen corresponding path program 1 times
[2024-10-11 12:18:32,625 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-10-11 12:18:32,625 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045026557]
[2024-10-11 12:18:32,625 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:18:32,625 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-10-11 12:18:32,790 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2024-10-11 12:18:32,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1148839662]
[2024-10-11 12:18:32,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-10-11 12:18:32,795 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-10-11 12:18:32,795 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3
[2024-10-11 12:18:32,798 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-10-11 12:18:32,799 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-10-11 12:18:33,734 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-10-11 12:18:33,737 INFO  L255         TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 39 conjuncts are in the unsatisfiable core
[2024-10-11 12:18:33,746 INFO  L278         TraceCheckSpWp]: Computing forward predicates...
[2024-10-11 12:18:47,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 1104 backedges. 442 proven. 234 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked.
[2024-10-11 12:18:47,056 INFO  L311         TraceCheckSpWp]: Computing backward predicates...