./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c --full-output --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f1d7dc9d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/certificate-witnesses-artifact/automizer/data/config -Xmx15G -Xms4m -jar /storage/repos/certificate-witnesses-artifact/automizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/certificate-witnesses-artifact/automizer/data -tc /storage/repos/certificate-witnesses-artifact/automizer/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c -s /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/certificate-witnesses-artifact/automizer --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 b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 --procedureinliner.inline.calls.to.implemented.procedures NEVER --traceabstraction.positions.where.we.compute.the.hoare.annotation All --witnessprinter.yaml.format.version 2.1 --witnessprinter.generate.graphml.witnesses false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.referee-eval-f1d7dc9-m [2024-09-20 12:59:59,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-09-20 12:59:59,839 INFO L114 SettingsManager]: Loading settings from /storage/repos/certificate-witnesses-artifact/automizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-09-20 12:59:59,843 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-09-20 12:59:59,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-09-20 12:59:59,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-09-20 12:59:59,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-09-20 12:59:59,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-09-20 12:59:59,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-09-20 12:59:59,867 INFO L153 SettingsManager]: * Use memory slicer=true [2024-09-20 12:59:59,868 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-09-20 12:59:59,868 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-09-20 12:59:59,869 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-09-20 12:59:59,871 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-09-20 12:59:59,871 INFO L153 SettingsManager]: * Use SBE=true [2024-09-20 12:59:59,872 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-09-20 12:59:59,872 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-09-20 12:59:59,872 INFO L153 SettingsManager]: * sizeof long=4 [2024-09-20 12:59:59,873 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-09-20 12:59:59,873 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-09-20 12:59:59,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-09-20 12:59:59,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-09-20 12:59:59,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-09-20 12:59:59,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-09-20 12:59:59,878 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-09-20 12:59:59,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-09-20 12:59:59,879 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-09-20 12:59:59,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-09-20 12:59:59,879 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-09-20 12:59:59,879 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-09-20 12:59:59,880 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-09-20 12:59:59,880 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-09-20 12:59:59,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 12:59:59,881 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-09-20 12:59:59,881 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-09-20 12:59:59,881 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-09-20 12:59:59,881 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-09-20 12:59:59,881 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-09-20 12:59:59,882 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-09-20 12:59:59,882 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-09-20 12:59:59,882 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-09-20 12:59:59,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-09-20 12:59:59,885 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/certificate-witnesses-artifact/automizer/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/certificate-witnesses-artifact/automizer 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 -> b2a54f54b02d2bb65a6f46eeae11edba1907f4f082d2aaa313102e422e7e6122 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.procedureinliner: Inline calls to implemented procedures -> NEVER Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: YAML Format version -> 2.1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Generate GraphML witnesses -> false [2024-09-20 13:00:00,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-09-20 13:00:00,174 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-09-20 13:00:00,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-09-20 13:00:00,179 INFO L270 PluginConnector]: Initializing CDTParser... [2024-09-20 13:00:00,179 INFO L274 PluginConnector]: CDTParser initialized [2024-09-20 13:00:00,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/certificate-witnesses-artifact/automizer/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2024-09-20 13:00:01,681 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-09-20 13:00:01,860 INFO L384 CDTParser]: Found 1 translation units. [2024-09-20 13:00:01,860 INFO L180 CDTParser]: Scanning /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c [2024-09-20 13:00:01,868 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/certificate-witnesses-artifact/automizer/data/4048e244b/494221f6a06c4561baf36735a4b6d57a/FLAG03787b83d [2024-09-20 13:00:02,248 INFO L435 CDTParser]: Successfully deleted /storage/repos/certificate-witnesses-artifact/automizer/data/4048e244b/494221f6a06c4561baf36735a4b6d57a [2024-09-20 13:00:02,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-09-20 13:00:02,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-09-20 13:00:02,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-09-20 13:00:02,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-09-20 13:00:02,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-09-20 13:00:02,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,261 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e88eeeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02, skipping insertion in model container [2024-09-20 13:00:02,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-09-20 13:00:02,441 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2024-09-20 13:00:02,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:00:02,471 INFO L200 MainTranslator]: Completed pre-run [2024-09-20 13:00:02,480 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/certificate-witnesses-artifact/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_valuebound5.c[458,471] [2024-09-20 13:00:02,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-09-20 13:00:02,508 INFO L204 MainTranslator]: Completed translation [2024-09-20 13:00:02,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02 WrapperNode [2024-09-20 13:00:02,509 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-09-20 13:00:02,510 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-09-20 13:00:02,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-09-20 13:00:02,511 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-09-20 13:00:02,517 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,533 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2024-09-20 13:00:02,533 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-09-20 13:00:02,533 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-09-20 13:00:02,533 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-09-20 13:00:02,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-09-20 13:00:02,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,544 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,558 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-09-20 13:00:02,558 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,558 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,567 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,568 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-09-20 13:00:02,569 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-09-20 13:00:02,569 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-09-20 13:00:02,569 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-09-20 13:00:02,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (1/1) ... [2024-09-20 13:00:02,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-09-20 13:00:02,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:00:02,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-09-20 13:00:02,601 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-09-20 13:00:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-09-20 13:00:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-09-20 13:00:02,643 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-09-20 13:00:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure main [2024-09-20 13:00:02,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2024-09-20 13:00:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-09-20 13:00:02,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2024-09-20 13:00:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2024-09-20 13:00:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-09-20 13:00:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-09-20 13:00:02,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-09-20 13:00:02,644 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-09-20 13:00:02,701 INFO L242 CfgBuilder]: Building ICFG [2024-09-20 13:00:02,703 INFO L268 CfgBuilder]: Building CFG for each procedure with an implementation [2024-09-20 13:00:02,839 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2024-09-20 13:00:02,839 INFO L291 CfgBuilder]: Performing block encoding [2024-09-20 13:00:02,866 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-09-20 13:00:02,866 INFO L318 CfgBuilder]: Removed 1 assume(true) statements. [2024-09-20 13:00:02,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:02 BoogieIcfgContainer [2024-09-20 13:00:02,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-09-20 13:00:02,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-09-20 13:00:02,869 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-09-20 13:00:02,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-09-20 13:00:02,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:02" (1/3) ... [2024-09-20 13:00:02,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c149705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:02, skipping insertion in model container [2024-09-20 13:00:02,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:02" (2/3) ... [2024-09-20 13:00:02,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c149705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:02, skipping insertion in model container [2024-09-20 13:00:02,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:02" (3/3) ... [2024-09-20 13:00:02,875 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_valuebound5.c [2024-09-20 13:00:02,892 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-09-20 13:00:02,892 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-09-20 13:00:02,955 INFO L335 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-09-20 13:00:02,961 INFO L336 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=All, 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;@2297b6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-09-20 13:00:02,962 INFO L337 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-09-20 13:00:02,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-09-20 13:00:02,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 13:00:02,977 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:00:02,977 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:00:02,978 INFO L399 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:00:02,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:02,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1238311395, now seen corresponding path program 1 times [2024-09-20 13:00:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:00:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314026981] [2024-09-20 13:00:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:00:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:00:03,130 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-09-20 13:00:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:00:03,145 INFO L381 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-09-20 13:00:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:00:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:00:03,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:00:03,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314026981] [2024-09-20 13:00:03,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314026981] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:00:03,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:00:03,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-09-20 13:00:03,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662162571] [2024-09-20 13:00:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:00:03,163 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-09-20 13:00:03,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:00:03,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-09-20 13:00:03,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-09-20 13:00:03,188 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:00:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:00:03,221 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2024-09-20 13:00:03,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-09-20 13:00:03,223 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-20 13:00:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:00:03,229 INFO L225 Difference]: With dead ends: 44 [2024-09-20 13:00:03,229 INFO L226 Difference]: Without dead ends: 22 [2024-09-20 13:00:03,232 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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-09-20 13:00:03,236 INFO L434 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:00:03,237 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:00:03,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-09-20 13:00:03,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-09-20 13:00:03,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:00:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2024-09-20 13:00:03,276 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 16 [2024-09-20 13:00:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:00:03,277 INFO L474 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2024-09-20 13:00:03,277 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:00:03,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:03,279 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2024-09-20 13:00:03,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-09-20 13:00:03,279 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:00:03,280 INFO L216 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:00:03,280 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-09-20 13:00:03,281 INFO L399 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:00:03,285 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:03,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1910922015, now seen corresponding path program 1 times [2024-09-20 13:00:03,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:00:03,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693654457] [2024-09-20 13:00:03,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:03,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:00:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:00:03,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2097359590] [2024-09-20 13:00:03,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:03,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:00:03,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:00:03,334 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:00:03,336 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-09-20 13:00:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:00:03,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-09-20 13:00:03,411 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:00:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:00:03,516 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-09-20 13:00:03,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:00:03,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693654457] [2024-09-20 13:00:03,517 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:00:03,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097359590] [2024-09-20 13:00:03,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097359590] provided 1 perfect and 0 imperfect interpolant sequences [2024-09-20 13:00:03,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-09-20 13:00:03,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-09-20 13:00:03,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658550123] [2024-09-20 13:00:03,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:00:03,519 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:00:03,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:00:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:00:03,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-09-20 13:00:03,520 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:00:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:00:03,590 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2024-09-20 13:00:03,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:00:03,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2024-09-20 13:00:03,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:00:03,593 INFO L225 Difference]: With dead ends: 33 [2024-09-20 13:00:03,593 INFO L226 Difference]: Without dead ends: 29 [2024-09-20 13:00:03,593 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-09-20 13:00:03,594 INFO L434 NwaCegarLoop]: 18 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:00:03,595 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 69 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:00:03,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-09-20 13:00:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-09-20 13:00:03,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-09-20 13:00:03,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2024-09-20 13:00:03,606 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 16 [2024-09-20 13:00:03,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:00:03,606 INFO L474 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2024-09-20 13:00:03,607 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-09-20 13:00:03,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:03,607 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2024-09-20 13:00:03,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-09-20 13:00:03,608 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:00:03,608 INFO L216 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:00:03,628 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-09-20 13:00:03,809 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:00:03,809 INFO L399 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:00:03,810 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:03,810 INFO L85 PathProgramCache]: Analyzing trace with hash 306700420, now seen corresponding path program 1 times [2024-09-20 13:00:03,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:00:03,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705460194] [2024-09-20 13:00:03,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:00:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:00:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1474361844] [2024-09-20 13:00:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:03,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:00:03,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:00:03,841 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:00:03,842 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-09-20 13:00:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:00:03,892 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-09-20 13:00:03,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:00:03,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-09-20 13:00:03,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:00:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-09-20 13:00:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:00:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705460194] [2024-09-20 13:00:04,160 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:00:04,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474361844] [2024-09-20 13:00:04,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474361844] provided 1 perfect and 1 imperfect interpolant sequences [2024-09-20 13:00:04,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-09-20 13:00:04,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-09-20 13:00:04,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269896907] [2024-09-20 13:00:04,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-09-20 13:00:04,161 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-09-20 13:00:04,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:00:04,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-09-20 13:00:04,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-09-20 13:00:04,162 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 13:00:04,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:00:04,219 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2024-09-20 13:00:04,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-09-20 13:00:04,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2024-09-20 13:00:04,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:00:04,220 INFO L225 Difference]: With dead ends: 35 [2024-09-20 13:00:04,220 INFO L226 Difference]: Without dead ends: 30 [2024-09-20 13:00:04,221 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-09-20 13:00:04,222 INFO L434 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-09-20 13:00:04,223 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-09-20 13:00:04,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-09-20 13:00:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-09-20 13:00:04,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-09-20 13:00:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-09-20 13:00:04,238 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 23 [2024-09-20 13:00:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:00:04,238 INFO L474 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-09-20 13:00:04,238 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-09-20 13:00:04,239 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-09-20 13:00:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-09-20 13:00:04,239 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:00:04,240 INFO L216 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:00:04,252 INFO L540 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-09-20 13:00:04,440 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:00:04,440 INFO L399 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:00:04,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:04,441 INFO L85 PathProgramCache]: Analyzing trace with hash 749725687, now seen corresponding path program 1 times [2024-09-20 13:00:04,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:00:04,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449802497] [2024-09-20 13:00:04,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:04,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:00:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:00:04,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789108061] [2024-09-20 13:00:04,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:04,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:00:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:00:04,488 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:00:04,500 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-09-20 13:00:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-09-20 13:00:04,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-09-20 13:00:04,545 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:00:04,634 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 13:00:04,634 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:00:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-09-20 13:00:04,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:00:04,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449802497] [2024-09-20 13:00:04,748 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:00:04,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789108061] [2024-09-20 13:00:04,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789108061] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:00:04,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:00:04,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2024-09-20 13:00:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651223337] [2024-09-20 13:00:04,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:00:04,750 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-09-20 13:00:04,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:00:04,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-09-20 13:00:04,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-09-20 13:00:04,752 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-20 13:00:04,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-09-20 13:00:04,870 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2024-09-20 13:00:04,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-09-20 13:00:04,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 29 [2024-09-20 13:00:04,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-09-20 13:00:04,872 INFO L225 Difference]: With dead ends: 45 [2024-09-20 13:00:04,872 INFO L226 Difference]: Without dead ends: 39 [2024-09-20 13:00:04,873 INFO L433 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-09-20 13:00:04,874 INFO L434 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-09-20 13:00:04,874 INFO L435 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-09-20 13:00:04,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-09-20 13:00:04,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-09-20 13:00:04,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 9 states have call successors, (9), 6 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-09-20 13:00:04,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2024-09-20 13:00:04,889 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 29 [2024-09-20 13:00:04,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-09-20 13:00:04,889 INFO L474 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2024-09-20 13:00:04,889 INFO L475 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 7 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-09-20 13:00:04,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:04,890 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2024-09-20 13:00:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-09-20 13:00:04,891 INFO L208 NwaCegarLoop]: Found error trace [2024-09-20 13:00:04,891 INFO L216 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-09-20 13:00:04,907 INFO L552 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-09-20 13:00:05,095 WARN L456 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:00:05,096 INFO L399 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-09-20 13:00:05,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-09-20 13:00:05,096 INFO L85 PathProgramCache]: Analyzing trace with hash 608187154, now seen corresponding path program 2 times [2024-09-20 13:00:05,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-09-20 13:00:05,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302652295] [2024-09-20 13:00:05,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-09-20 13:00:05,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-09-20 13:00:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-09-20 13:00:05,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1274045745] [2024-09-20 13:00:05,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-09-20 13:00:05,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-09-20 13:00:05,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/certificate-witnesses-artifact/automizer/z3 [2024-09-20 13:00:05,138 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-09-20 13:00:05,140 INFO L327 MonitoredProcess]: [MP /storage/repos/certificate-witnesses-artifact/automizer/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-09-20 13:00:05,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-09-20 13:00:05,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-09-20 13:00:05,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-09-20 13:00:05,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-09-20 13:00:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 19 proven. 39 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-09-20 13:00:05,471 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-09-20 13:00:13,771 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ c_main_~y~0 (* c_main_~y~0 c_main_~y~0)) (+ c_main_~c~0 (* c_main_~c~0 c_main_~y~0)))) is different from false [2024-09-20 13:00:25,860 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* 2 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)) (+ (* 2 c_main_~c~0) (* c_main_~c~0 c_main_~y~0)))) is different from false [2024-09-20 13:02:08,165 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)) (= (+ (* c_main_~c~0 4) (* c_main_~c~0 c_main_~y~0)) (+ (* 4 c_main_~y~0) (* c_main_~y~0 c_main_~y~0)))) is different from false [2024-09-20 13:02:08,280 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 17 proven. 20 refuted. 0 times theorem prover too weak. 22 trivial. 21 not checked. [2024-09-20 13:02:08,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-09-20 13:02:08,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302652295] [2024-09-20 13:02:08,281 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-09-20 13:02:08,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274045745] [2024-09-20 13:02:08,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274045745] provided 0 perfect and 2 imperfect interpolant sequences [2024-09-20 13:02:08,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-09-20 13:02:08,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 26 [2024-09-20 13:02:08,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524878507] [2024-09-20 13:02:08,281 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-09-20 13:02:08,282 INFO L551 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-09-20 13:02:08,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-09-20 13:02:08,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-09-20 13:02:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=418, Unknown=9, NotChecked=132, Total=650 [2024-09-20 13:02:08,288 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 19 states have internal predecessors, (40), 13 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-09-20 13:02:16,822 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))))) (.cse3 (= (+ c_main_~y~0 .cse2) (+ c_main_~c~0 .cse1))) (.cse4 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0)))) (and (or .cse0 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse2))) (or .cse0 .cse3) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse2)) (or .cse4 .cse3) (or .cse4 (= (+ (* 2 c_main_~y~0) .cse2) (+ (* 2 c_main_~c~0) .cse1))) (or .cse4 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse2)))))) is different from false [2024-09-20 13:02:20,835 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_main_~y~0 c_main_~y~0))) (let ((.cse0 (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse2 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0))))) (.cse3 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0))) (and (or .cse0 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse2))) (or .cse3 (= (+ c_main_~y~0 .cse2) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) .cse0 (= (* c_main_~y~0 c_main_~k~0) .cse2)) (or .cse3 (= (+ (* 2 c_main_~y~0) .cse2) (+ (* 2 c_main_~c~0) .cse1))) (or .cse3 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse2)))))) is different from false [2024-09-20 13:02:24,845 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse0 (* c_main_~y~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or .cse2 (= (+ (* c_main_~c~0 4) .cse1) (+ (* 4 c_main_~y~0) .cse0))) (or .cse2 (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))) (or .cse2 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse0))))) is different from false [2024-09-20 13:02:28,861 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse2 (* c_main_~c~0 c_main_~y~0)) (.cse1 (* c_main_~y~0 c_main_~y~0))) (and (or .cse0 (= (+ c_main_~y~0 .cse1) (+ c_main_~c~0 .cse2))) (or (< c_main_~c~0 c_main_~k~0) (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse1 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (* c_main_~y~0 c_main_~k~0) .cse1)) (or .cse0 (= (+ (* 2 c_main_~y~0) .cse1) (+ (* 2 c_main_~c~0) .cse2))) (or .cse0 (= (+ (* 3 c_main_~c~0) .cse2) (+ (* 3 c_main_~y~0) .cse1))))) is different from false [2024-09-20 13:02:32,872 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (not (= (mod (+ (* 3 c_main_~y~0 c_main_~y~0) (* 2 c_main_~y~0 c_main_~y~0 c_main_~y~0) (* 3 c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)) 4) 0))) (.cse1 (* c_main_~c~0 c_main_~y~0)) (.cse0 (* c_main_~y~0 c_main_~y~0))) (and (or (not (= (* 4 c_main_~x~0) (+ (* (* c_main_~y~0 c_main_~y~0 c_main_~y~0) 2) .cse0 (* c_main_~y~0 c_main_~y~0 c_main_~y~0 c_main_~y~0)))) (= (+ c_main_~y~0 .cse0) (+ c_main_~c~0 .cse1))) (or (< c_main_~c~0 c_main_~k~0) (= (* c_main_~y~0 c_main_~k~0) .cse0)) (or .cse2 (= (+ (* 2 c_main_~y~0) .cse0) (+ (* 2 c_main_~c~0) .cse1))) (or .cse2 (= (+ (* 3 c_main_~c~0) .cse1) (+ (* 3 c_main_~y~0) .cse0))))) is different from false [2024-09-20 13:04:21,841 WARN L293 SmtUtils]: Spent 16.04s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-09-20 13:04:25,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []